Algorithms

About this book

Algorithms was written by Jeff Erickson. This edition dates from 2019, and runs to about 472 pages.

It is shelved at QA76.9 .A43 E54 2019, which is where a library would file it.

What it covers

• Recursion, backtracking and dynamic programming, taught properly.
• Greedy algorithms, graphs, shortest paths and flows.
• NP-hardness, with reductions done carefully.
• Proofs of correctness treated as part of the algorithm.

Colophon

Licence

CC BY 4.0

Read it at

jeffe.cs.illinois.edu ↗

On this site

This licence allows a copy to be served here, with attribution.