Randomized Algorithms by Raghavan and Motwani. I've been researching/teaching these topics for many years and still find some new insight every time I open this book.
……算法方面，你还得补充不少额外的内容。数值方法——Tuekolsky 和 Vetterling 写的《数值分析 第3版：科学计算的艺术》（Numerical Recipes 3rd Edition: The Art of Scientific Computing）。我超爱这本书。[5] 随机化算法——Motwani 和 Raghavan 写的《随机化算法》（Randomized Algorithms）。[6] Michael Mitzenmacher 的《概率与计算：随机化算法与概率分析》（Probability and Computing: Randomized Algorithms and Probabilistic Analysis），[7] 难题（比如 NP 问题）——近似算法……
…Algorithms you will need to cover quite a bit of additional material. Numerical methods -- Numerical Recipes 3rd Edition: The Art of Scientific Computing by Tuekolsky and Vetterling. I love this book. [5] Randomized algorithms -- Randomized Algorithms by Motwani and Raghavan. [6], Probability and Computing: Randomized Algorithms and Probabilistic Analysis by Michael Mitzenmacher, [7] Hard problems (like NP) -- Approximation…
…addition to being much more mathematically self-contained, there is more focus on models and techniques that I imagine software engineers might actually use, e.g. hashing, load balancing. In addition, Randomized Algorithms by Motwani and Raghavan is a fantastic book, and should be doable after completing Mitzenmacher and Upfal. It goes into further depth on techinques for designing randomized algorithms. A bit orthogonal…
给那些像我一样犯迷糊的人提个醒：最近去世的并不是 Prabhakar Raghavan，而是他在《随机化算法》（Randomized Algorithms）中的合著者 Rajeev Motwani。顺便说一句，我墙裂推荐他们的书。里面全都是 Google 诞生的蛛丝马迹。
For those who were confused (as I was), Prabhakar Raghavan wasn't the one who recently died, it was his co-author in Randomized Algorithms, Rajeev Motwani. BTW, I highly recommend their book. In it is all the evidence of the genesis of Google.
……他还和这些作者共同撰写了另一篇开创性的搜索论文《What Can You Do With A Web In Your Pocket》。[3] 他还是两本被广泛使用的理论计算机科学教材的作者：《随机化算法》（Randomized Algorithms，剑桥大学出版社 1995 年，ISBN 978-0-521-47465-8，与 Prabhakar Raghavan 合著）和《自动机理论、语言和计算导论》（Introduction to Automata Theory, Languages, and Computation，第2版，Addison-Wesley 2000 年，与 John Hopcroft 等合著……
…He also co-authored another seminal search paper What Can You Do With A Web In Your Pocket with those same authors.[3] He was also an author of two widely-used theoretical computer science textbooks, Randomized Algorithms (Cambridge University Press 1995, ISBN 978-0-521-47465-8, with Prabhakar Raghavan) and Introduction to Automata Theory, Languages, and Computation (2nd ed., Addison-Wesley, 2000, with John Hopcroft and…
…random pivots, damnit! :) The article you point to doesn't seem to address the complexity of quicksort with random pivots. However, that is proven to be expected O(n log n) time for any data in Motwani's Randomized Algorithms book, and I don't think the correctness of that has ever been questioned.
Raghavan 和 Motwani 写的《随机化算法》（Randomized Algorithms）。我研究/教授这些课题很多年了，每次翻开这本书依然能得到新的启发。
Randomized Algorithms by Raghavan and Motwani. I've been researching/teaching these topics for many years and still find some new insight every time I open this book.
……算法方面，你还得补充不少额外的内容。数值方法——Tuekolsky 和 Vetterling 写的《数值分析 第3版：科学计算的艺术》（Numerical Recipes 3rd Edition: The Art of Scientific Computing）。我超爱这本书。[5] 随机化算法——Motwani 和 Raghavan 写的《随机化算法》（Randomized Algorithms）。[6] Michael Mitzenmacher 的《概率与计算：随机化算法与概率分析》（Probability and Computing: Randomized Algorithms and Probabilistic Analysis），[7] 难题（比如 NP 问题）——近似算法……
…Algorithms you will need to cover quite a bit of additional material. Numerical methods -- Numerical Recipes 3rd Edition: The Art of Scientific Computing by Tuekolsky and Vetterling. I love this book. [5] Randomized algorithms -- Randomized Algorithms by Motwani and Raghavan. [6], Probability and Computing: Randomized Algorithms and Probabilistic Analysis by Michael Mitzenmacher, [7] Hard problems (like NP) -- Approximation…
……除了数学上更加自成体系之外，它还更加侧重于我认为软件工程师在实际工作中可能用得到的模型和技术，比如 hashing、load balancing。此外，Motwani 和 Raghavan 写的《随机化算法》（Randomized Algorithms）也是一本神作，搞定 Mitzenmacher 和 Upfal 的书之后应该就能读了。它对设计随机化算法的技术做了更深入的探讨。稍微有点互不相干……
…addition to being much more mathematically self-contained, there is more focus on models and techniques that I imagine software engineers might actually use, e.g. hashing, load balancing. In addition, Randomized Algorithms by Motwani and Raghavan is a fantastic book, and should be doable after completing Mitzenmacher and Upfal. It goes into further depth on techinques for designing randomized algorithms. A bit orthogonal…
给那些像我一样犯迷糊的人提个醒：最近去世的并不是 Prabhakar Raghavan，而是他在《随机化算法》（Randomized Algorithms）中的合著者 Rajeev Motwani。顺便说一句，我墙裂推荐他们的书。里面全都是 Google 诞生的蛛丝马迹。
For those who were confused (as I was), Prabhakar Raghavan wasn't the one who recently died, it was his co-author in Randomized Algorithms, Rajeev Motwani. BTW, I highly recommend their book. In it is all the evidence of the genesis of Google.
……他还和这些作者共同撰写了另一篇开创性的搜索论文《What Can You Do With A Web In Your Pocket》。[3] 他还是两本被广泛使用的理论计算机科学教材的作者：《随机化算法》（Randomized Algorithms，剑桥大学出版社 1995 年，ISBN 978-0-521-47465-8，与 Prabhakar Raghavan 合著）和《自动机理论、语言和计算导论》（Introduction to Automata Theory, Languages, and Computation，第2版，Addison-Wesley 2000 年，与 John Hopcroft 等合著……
…He also co-authored another seminal search paper What Can You Do With A Web In Your Pocket with those same authors.[3] He was also an author of two widely-used theoretical computer science textbooks, Randomized Algorithms (Cambridge University Press 1995, ISBN 978-0-521-47465-8, with Prabhakar Raghavan) and Introduction to Automata Theory, Languages, and Computation (2nd ed., Addison-Wesley, 2000, with John Hopcroft and…
……随机 pivots 啊，卧槽！:) 你引用的那篇文章似乎根本没讨论带随机 pivot 的 quicksort 的复杂度。然而，在 Motwani 的《随机化算法》（Randomized Algorithms）一书中，已经证明了对于任意数据其期望时间都是 O(n log n)，而且我觉得这个证明的正确性从来没人质疑过。
…random pivots, damnit! :) The article you point to doesn't seem to address the complexity of quicksort with random pivots. However, that is proven to be expected O(n log n) time for any data in Motwani's Randomized Algorithms book, and I don't think the correctness of that has ever been questioned.