具體描述
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.
用戶評價
相比起 Sedgewick 的 Algorithms，更注重大局觀和數學證明。但因為不講實現細節，所以讀者可能容易落入眼高手低的陷阱。
評分 評分 評分相比起 Sedgewick 的 Algorithms，更注重大局觀和數學證明。但因為不講實現細節，所以讀者可能容易落入眼高手低的陷阱。
評分 評分##非常細緻的書，算法證明和靈感來源都有
評分##Prof. Tim Roughgarden的力作。歸納整理的很好很好
評分##不是應該還有2嗎，我怎麼沒有找到2 原書是這麼寫的，但是經過反復驗證，c=a*a，而不是c=b*b。所以這裏應該是作者筆誤寫錯瞭。 順便貼一下js的實現： /* * 快速n方計算 * */ function fastPower (a, b) { var c, temp; if (b === 1) { return a; } else { c = b * b; temp = fastPower(c, Math.floor(b/2)) } if (...
評分##非常細緻的書，算法證明和靈感來源都有
相關圖書
本站所有內容均為互聯網搜尋引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 book.qciss.net All Rights Reserved. 圖書大百科 版權所有