Bookbot

Algorithms Illuminated (Part 3)

Hodnotenie knihy

Parametre

  • 232 stránok
  • 9 hodin čítania

Viac o knihe

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

Nákup knihy

Algorithms Illuminated (Part 3), Tim Roughgarden

Jazyk
Rok vydania
2019
product-detail.submit-box.info.binding
(mäkká)
Akonáhle sa objaví, pošleme e-mail.

Platobné metódy

4,7
Výborná
10 Hodnotenie

Tu nám chýba tvoja recenzia

Titul
Algorithms Illuminated (Part 3)
Jazyk
anglicky
Rok vydania
2019
Väzba
mäkká
Počet strán
232
ISBN10
0999282948
ISBN13
9780999282946
Hodnotenie
4,7 z 5
Anotácia
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).