Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2)
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2) by Tim Roughgarden
English | August 5, 2018 | ISBN: 0999282921 | 222 pages | PDF | 7.93 Mb
English | August 5, 2018 | ISBN: 0999282921 | 222 pages | PDF | 7.93 Mb
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. The book includes solutions to all quizzes and selected problems, and a series of YouTube videos by the author accompanies the book. Part 2 of this book series covers graph search and its applications, shortest-path algorithms, and the applications and implementation of several data structures: heaps, search trees, hash tables, and bloom filters.