Hitler: Ascent 1889-1939, Volume 1

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). Preface......Page 7 The Greedy Algorithm Design Paradigm......Page 13 A Scheduling Problem......Page 16 Developing a Greedy Algorithm......Page 18 Proof of Correctness......Page 24 Problems......Page 33 Codes......Page 35 Codes as Trees......Page 40 Huffman's Greedy Algorithm......Page 44 Proof of Correctness......Page 53 Problems......Page 61 Problem Definition......Page 64 Prim's Algorithm......Page 69 Speeding Up Prim's Algorithm via Heaps......Page 74 Prim's Algorithm: Proof of Correctness......Page 81 Kruskal's Algorithm......Page 88 Speeding Up Kruskal's Algorithm via Union-Find......Page 93 Kruskal's Algorithm: Proof of Correctness......Page 103 Application: Single-Link Clustering......Page 106 Problems......Page 111 Introduction to Dynamic Programming......Page 115 The Weighted Independent Set Problem......Page 116 A Linear-Time Algorithm for WIS in Paths......Page 120 A Reconstruction Algorithm......Page 128 The Principles of Dynamic Programming......Page 130 The Knapsack Problem......Page 135 Problems......Page 145 Sequence Alignment......Page 149 Optimal Binary Search Trees......Page 160 Problems......Page 175 Shortest Paths with Negative Edge Lengths......Page 179 The Bellman-Ford Algorithm......Page 184 The All-Pairs Shortest Path Problem......Page 197 The Floyd-Warshall Algorithm......Page 199 Problems......Page 210 Epilogue: A Field Guide to Algorithm Design......Page 213 Hints and Solutions to Selected Problems......Page 215 Index......Page 223 "Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and database system implementation. Studying algorithms can make make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject--a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons."--Back cover 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).