具体描述
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.
用户评价
##Prof. Tim Roughgarden的力作。归纳整理的很好很好
评分相比起 Sedgewick 的 Algorithms，更注重大局观和数学证明。但因为不讲实现细节，所以读者可能容易落入眼高手低的陷阱。
评分 评分 评分 评分##Tim老师跟着自己在coursera上algorithms的specialization写的书。没有CLRS覆盖的内容多，但是我觉得讲解的更清晰更细致，尤其是里面涉及了很多code时候需要注意的细节。不过这个感受也可能存在bias，因为这是第二遍深入复习和dive的时候的感受。
评分 评分相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.qciss.net All Rights Reserved. 图书大百科 版权所有