Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming

Algorithms Illuminated (Part 3)

Greedy Algorithms and Dynamic Programming

By
Tim Roughgarden
Tim Roughgarden
2019 • 217 pages

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

Tags

Become a Librarian

Series

Featured Series

4 primary books

#3 in Algorithms Illuminated

Algorithms Illuminated is a 4-book series with 4 primary works first released in 2017 with contributions by Tim Roughgarden.

#1
Algorithms Illuminated (Part 1): The Basics
#2
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures
#3
Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
#4
Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems

Reviews

Popular Reviews

Reviews with the most likes.

There are no reviews for this book. Add yours and it'll show up right here!