Placeholder text

Go to cart

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

By Tim Roughgarden

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

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

Only 2 items left in stock
Description
Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).
Product details
Binding:
Paperback
Edition:
1
Number of Pages:
232
Release Date:
2019-05-01
Publication Date:
2019-05-01
Publisher:
Soundlikeyourself Publishing, LLC
Languages:
Published: English, Original: English
ISBN10:
0999282948
GPSR Manufacturer Reference:
[email protected]
Weight:
338 g
Height:
22.8 cm
Width:
15.2 cm
Thickness:
1.3 cm
Buy on Amazon

Condition

Show more

Show less
Very good
Almost no signs of wear. Book pages have no markings, accessories are intact and all other media are in good condition.
Available immediately
€12,69

Incl. VAT, plus shipping costs

PayPal
Visa
Mastercard
American Express
Only 2 items left in stock

Verified second-hand article

Verified second-hand item

Free shipping from 19€

€12,69