Algorithms Illuminated (Part 2) 在线电子书 图书标签: 算法 数据结构 计算机科学 Algorithm 2018
发表于2024-11-21
Algorithms Illuminated (Part 2) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024
我觉得写得很一般,特别是heap和dijkstra那部分,逻辑混乱,乱七八糟,给3星吧。
评分我觉得写得很一般,特别是heap和dijkstra那部分,逻辑混乱,乱七八糟,给3星吧。
评分写的真的是很详细了,很多我自己好不容易思考明白的问题这里都很清晰简洁的写出来了...比如之前一直不明白为什么kosaraju第二遍的dfs为什么不能在原图上用逆序的原因——》因为topo order在DAG和directed cyclic graph有不一样的property...良心之作
评分我觉得写得很一般,特别是heap和dijkstra那部分,逻辑混乱,乱七八糟,给3星吧。
评分我觉得写得很一般,特别是heap和dijkstra那部分,逻辑混乱,乱七八糟,给3星吧。
Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he has taught and researched algorithms since 2004. This book is the second of a four-part series based on his online algorithms courses that have been running regularly since 2012.
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.
评分
评分
评分
评分
Algorithms Illuminated (Part 2) 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024