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
Pages : | 472 |
Size : | 25.7 MB |
Downloads: | 88 |
Created: | 2022-02-01 |
License: | CC BY |
Author(s): | by Jeff Erickson |
Warning: Trying to access array offset on false in /home/tutovnfz/public_html/amp/article-amp.php on line 263
Others related eBooks about Algorithms
Download free course Go Succinctly, pdf file on 104 pages by Mark Lewin.
Download free course Mastering Ethereum, pdf file on 424 pages by Andreas M. Antonopoulos, Gavin Wood.
Download free course A Graduate Course in Applied Cryptography, pdf file on 900 pages by by Dan Boneh, Victor Shoup.
Download free course Contextual Process Digitalization, pdf file on 282 pages by Albert Fleischmann, Stefan Oppl, Werner Schmidt, Christian Stary.
Download free course Git Internals, pdf file on 121 pages by Scott Chacon.