Explore the latest books of this year!
Bookbot

Algorithms Illuminated (Part 3)

Parameters

  • 232 pages
  • 9 hours of reading

More about the book

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).

Book purchase

Algorithms Illuminated (Part 3), Tim Roughgarden

Language
Released
2019
product-detail.submit-box.info.binding
(Paperback)
We’ll email you as soon as we track it down.

Payment methods

No one has rated yet.Add rating