發表於2025-03-06
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 first 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. Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.
Algorithms Illuminated 下載 mobi pdf epub txt 電子書 格式 2025
Algorithms Illuminated 下載 mobi epub pdf 電子書##Prof. Tim Roughgarden的力作。歸納整理的很好很好
評分##Tim老師跟著自己在coursera上algorithms的specialization寫的書。沒有CLRS覆蓋的內容多,但是我覺得講解的更清晰更細緻,尤其是裏麵涉及瞭很多code時候需要注意的細節。不過這個感受也可能存在bias,因為這是第二遍深入復習和dive的時候的感受。
評分相比起 Sedgewick 的 Algorithms,更注重大局觀和數學證明。但因為不講實現細節,所以讀者可能容易落入眼高手低的陷阱。
評分 評分##非常細緻的書,算法證明和靈感來源都有
評分Algorithms Illuminated mobi epub pdf txt 電子書 格式下載 2025