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

Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming by Tim Roughgarden 0999282948 9780999282946
Stock Image - Actual Cover May Vary


 

Our Price: $17.49

Quantity:39

 
ISBN: 0999282948


Condition:
New [Add $99.00]
Like-New [Add $0.60]
Very-Good [Add $0.40]
Good [Add $0.20]
Acceptable

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

Author: Tim Roughgarden

Language: English

Binding: Paperback

Pages: 229

Publisher: Soundlikeyourself Publishing, LLC

Publication Date: 2019-05-01


Share your shopping experience. Write a review here »

Browse for more products in the same category as this item:

Binding > Paperback