Algorithms Illuminated Part 3: Greedy Algorithms and Dynamic Programming

English | 2019 | ISBN: 978-0999282946 | 229 Pages | PDF | 10 MB

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).