Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
Huge savings for students
Each student receives a 50% discount off of most books in the HSG Book Store. During class, please ask the instructor about purchase details.List Price: | $19.99 |
Price: | $10.00 |
You Save: | $10.00 |
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).
Soundlikeyourself Publishing, LLC