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.
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.
評分
評分
評分
評分
寫的真的是很詳細瞭,很多我自己好不容易思考明白的問題這裏都很清晰簡潔的寫齣來瞭...比如之前一直不明白為什麼kosaraju第二遍的dfs為什麼不能在原圖上用逆序的原因——》因為topo order在DAG和directed cyclic graph有不一樣的property...良心之作
评分寫的真的是很詳細瞭,很多我自己好不容易思考明白的問題這裏都很清晰簡潔的寫齣來瞭...比如之前一直不明白為什麼kosaraju第二遍的dfs為什麼不能在原圖上用逆序的原因——》因為topo order在DAG和directed cyclic graph有不一樣的property...良心之作
评分我覺得寫得很一般,特彆是heap和dijkstra那部分,邏輯混亂,亂七八糟,給3星吧。
评分我覺得寫得很一般,特彆是heap和dijkstra那部分,邏輯混亂,亂七八糟,給3星吧。
评分我覺得寫得很一般,特彆是heap和dijkstra那部分,邏輯混亂,亂七八糟,給3星吧。
本站所有內容均為互聯網搜索引擎提供的公開搜索信息,本站不存儲任何數據與內容,任何內容與數據均與本站無關,如有需要請聯繫相關搜索引擎包括但不限於百度,google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有