…really enjoyed Robert Sedgewick's Algorithms (part I and II) courses on Coursera. I learned much more in those classes than I did in my data structures class in college. The textbook that accompanies it (Algorithms Fourth edition) is really good too. I left that course with a much, much stronger understanding and appreciation for algorithms/data structures.
……并想出了一个办法。很快我就发现，自己的部分工作实际上是重新发明了 k-D 树，也就是说，对于正整数 k，它是 k 维的搜索树。如果我没记错的话，罗伯特·塞奇威克和凯文·韦恩的《算法 第四版》（Addison-Wesley 出版社，纽约，2011）里讲到了 k-D 树。所以，k-D 树很像是一维常见二分搜索在 k 维上的泛化推广。不过在那个场景下，还需要一些分割超平面和少许回溯……
…and thought of a way. Soon I learned that part of my work reinvented k-D trees, that is, for positive integer k, search trees in k-dimensions. IIRC, k-D trees are in Robert Sedgewick and Kevin Wayne, Algorithms, FOURTH EDITION, Addison-Wesley, New York, 2011. So, k-D trees are a lot like a k dimensional generalization of the usual one dimensional binary search. But, there, also need some cutting planes and a little backtracking…
> The Algorithm Design Manual and Algorithms: Fourth Edition are both books I picked up back in the day to refresh some of the my university algorithm class studies. I gave up midway, and found them pretty dry, and not applicable to my day-to-day work. These are…
塞奇威克和韦恩写的《算法（第4版）》。比 CLRS（算法导论）要更平易近人一些。
Algorithms, Fourth Edition, by Sedgewick and Wayne. A bit more accessible than the CLRS.
……真的很喜欢罗伯特·塞奇威克在 Coursera 上的《算法》（第一部分和第二部分）课程。我在这些课上学到的东西，比在大学数据结构课上学到的多得多。配套的教材（《算法》第四版）也写得极好。学完那门课后，我对算法和数据结构的理解和认知都有了质的飞跃。
…really enjoyed Robert Sedgewick's Algorithms (part I and II) courses on Coursera. I learned much more in those classes than I did in my data structures class in college. The textbook that accompanies it (Algorithms Fourth edition) is really good too. I left that course with a much, much stronger understanding and appreciation for algorithms/data structures.
……并想出了一个办法。很快我就发现，自己的部分工作实际上是重新发明了 k-D 树，也就是说，对于正整数 k，它是 k 维的搜索树。如果我没记错的话，罗伯特·塞奇威克和凯文·韦恩的《算法 第四版》（Addison-Wesley 出版社，纽约，2011）里讲到了 k-D 树。所以，k-D 树很像是一维常见二分搜索在 k 维上的泛化推广。不过在那个场景下，还需要一些分割超平面和少许回溯……
…and thought of a way. Soon I learned that part of my work reinvented k-D trees, that is, for positive integer k, search trees in k-dimensions. IIRC, k-D trees are in Robert Sedgewick and Kevin Wayne, Algorithms, FOURTH EDITION, Addison-Wesley, New York, 2011. So, k-D trees are a lot like a k dimensional generalization of the usual one dimensional binary search. But, there, also need some cutting planes and a little backtracking…
> 《算法设计手册》和《算法：第四版》都是我当年为了重温大学算法课内容而买的书。我看到一半就放弃了，觉得它们相当枯燥乏味，而且对我日常工作也没什么用处。这些都是……
> The Algorithm Design Manual and Algorithms: Fourth Edition are both books I picked up back in the day to refresh some of the my university algorithm class studies. I gave up midway, and found them pretty dry, and not applicable to my day-to-day work. These are…