Algorithms



Download free course Algorithms, pdf file on 472 pages by by Jeff Erickson.
Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This book is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the problem-solving process. The book includes important classical examples, hundreds of battle-tested exercises, far too many historical digressions, and exaclty four typos. Jeff Erickson is a computer science professor at the University of Illinois, Urbana-Champaign; this book is based on algorithms classes he has taught there since 1998.

Table of contents

  • Recursion
  • Backtracking
  • Dynamic Programming
  • Greedy Algorithms
  • Basic Graph Algorithms
  • Depth-First Search
  • Minimum Spanning Trees
  • Shortest Paths
  • All-Pairs Shortest Paths
  • Maximum Flows & Minimum Cuts
  • Applications of Flows and Cuts
  • NP-Hardness
Pages472
Size25.7 MB
File typePDF
Downloads165
Created2022-02-01
LicenseCC BY
Author(s)by Jeff Erickson
Cover of Algorithms

Download