Bookbot

Algorithms Illuminated (Part 3)

Maggiori informazioni sul libro

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

Acquisto del libro

Algorithms Illuminated (Part 3), Tim Roughgarden

Lingua
Pubblicato
2019
product-detail.submit-box.info.binding
(In brossura)
Ti avviseremo via email non appena lo rintracceremo.

Metodi di pagamento