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.
发表于2024-11-22
Algorithms Illuminated 2024 pdf epub mobi 电子书
原书是这么写的,但是经过反复验证,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 (...
评分原书是这么写的,但是经过反复验证,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 (...
评分原书是这么写的,但是经过反复验证,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 (...
评分原书是这么写的,但是经过反复验证,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 (...
评分原书是这么写的,但是经过反复验证,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 (...
图书标签: Algorithm 算法 计算机科学 计算机 2017 美國 工具教程 CS
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.
不是应该还有2吗,我怎么没有找到2
评分Tim老师跟着自己在coursera上algorithms的specialization写的书。没有CLRS覆盖的内容多,但是我觉得讲解的更清晰更细致,尤其是里面涉及了很多code时候需要注意的细节。不过这个感受也可能存在bias,因为这是第二遍深入复习和dive的时候的感受。
评分不是应该还有2吗,我怎么没有找到2
评分非常细致的书,算法证明和灵感来源都有
评分Tim老师跟着自己在coursera上algorithms的specialization写的书。没有CLRS覆盖的内容多,但是我觉得讲解的更清晰更细致,尤其是里面涉及了很多code时候需要注意的细节。不过这个感受也可能存在bias,因为这是第二遍深入复习和dive的时候的感受。
Algorithms Illuminated 2024 pdf epub mobi 电子书