算法与计算机科学khanacademy.org编辑精选
算法（可汗学院课程）
Algorithms
2015 — 2017，它一次次回到首页
黑点是上首页（≥ 50 分）的那次投稿，空心点是没冲上去的投稿，点越大分数越高。
导读
可汗学院的算法免费课程页面，涵盖排序、图、复杂度分析等计算机科学基础主题，通过交互式练习讲解算法。多位评论者分享了用它求职或复习的经历，也有人推荐 Coursera 上斯坦福和普林斯顿的算法课程作为替代。
为什么经久不衰：它是免费、交互式的算法入门资源，多次登上 HN 首页说明其长期被认可为自学计算机科学基础的可靠起点。
HN 评论精选
这门课实用性强，足以帮助非科班背景的人通过技术面试
这门课非常棒，帮我拿到了现在的工作。我的背景是化学/化工，申请数据科学家职位时，电话面试问到解法的复杂度，我承认自己不懂。虽然还是获得了现场面试机会，但面试前的周末我突击学完了这门课，现场面试果然考到了，对方很满意我学了这些，我最终拿到了 offer。我还发现用 Python 实现所有算法很有帮助。
tomwphillips查看英文原文
This is an excellent course and helped me get my current job. My background is chemistry/chemical engineering. I had applied for a data scientist position. Phone interview included a problem where I was asked about my solution's complexity. I admitted I didn't know about it. Still got called back for an interview on site, but the weekend before I powered through this course. Unsurprisingly, it came up in the on-site and they were really pleased I had learnt about it. I got the job. I also found it useful to implement all the algorithms in Python.
课程内容有缺口，缺少动态规划这一重要主题
奇怪的是他们完全没讲动态规划。我认为每门课都应至少包含一个经典的动态规划例子，比如最长递增子序列、最长公共子序列。
hal9000xp查看英文原文
It's strange they didn't cover dynamic programming at all. IMO every course should include at least one classical example of dynamic programming. For example: https://en.wikipedia.org/wiki/Longest_increasing_subsequence https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
推荐 Sedgewick 的教材作为另一条学习路径
对于想向其他大牛学算法的非 C 程序员，我发现 Sedgewick 的《算法》系列非常有用。Robert Sedgewick 在计算机科学领域深耕多年（1975 年获博士学位），是算法领域的权威专家之一。
SEJeff查看英文原文
For anyone wanting to learn algorithms from one of the other heavyweights, not being a C developer, I found this series extremely beneficial: https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structures/dp/0201314525 It also helps that Robert Sedgewick has been in compsci forever (got hit PHC in 1975) and is one of the subject matter experts in algorithms.
批评大公司算法面试已沦为死记硬背的题海战术
我热爱算法，也认为面试考算法是必要的，但我觉得技术社区近来的面试方式变得很荒唐。比如'把词典里的一个词一步步变成另一个词'这类题，好的面试应该意识到大多数人不会做，给出提示，并让做出合理尝试的候选人通过。而现在很多地方只要你不写出最优解、有语法错误就直接挂掉。这导致的结果就是算法八股文：成功与否取决于你背了多少算法题。
stevebot查看英文原文
Edit: Why the downvote? Disagree? I would love to hear more about why this attitude is helpful. I love algorithms, AND I think they are necessary in interviews, but I feel like the tech community has become ridiculous in how they interview for them lately. Example problem: Given two words in a dictionary, transform one word into another, changing one character at a time, using only words in the dictionary. A good interview would recognize most people have no clue how to solve this, give hints and still pass candidates who make a reasonable attempt but fail. Now it seems to be that most places will just fail you, if you don't know the most optimal answer and can't write it out without any syntax mistakes. This is ridiculous, and I have experienced it and this attitude around major tech companies. What this has resulted in is Algorithm trivia. Your ability to succeed is your ability to memorize every algorithm question and approach in existence.
历次讨论
同类还值得读
位运算技巧集
Bit Twiddling Hacks
斯坦福页面上的经典位运算技巧合集，收录了 popcount、前导/尾随零、位反转、交换、舍入等大量技巧，并附有解释和性能讨论。
算法与计算机科学上首页 8 次 · 2011–2024graphics.stanford.edu编辑精选如何不按平均评分排序
How Not To Sort By Average Rating
经典文章解释了为什么按平均评分排序不可靠：只有少量评价的条目（比如仅一条五星）会轻易排到最前，而评价数量的差异被忽略。
算法与计算机科学上首页 7 次 · 2009–2024evanmiller.org编辑精选数据结构可视化
Data Structure Visualizations
旧金山大学 David Galles 教授制作的数据结构与算法交互式可视化网站，涵盖 B 树、红黑树、排序、图算法等，可逐步操作观察其运行过程。
算法与计算机科学上首页 6 次 · 2011–2021cs.usfca.edu编辑精选1996 年以来的计算机科学最佳论文奖
Best Paper Awards in Computer Science since 1996
Jeff Huang 维护的一个汇总页面，收录了自 1996 年以来计算机科学各主要会议的“最佳论文奖”获奖名单，并按年份和会议整理，方便读者一站式浏览历届获奖论文。
算法与计算机科学上首页 6 次 · 2010–2018jeffhuang.com编辑精选算法（Jeff Erickson）
Algorithms, by Jeff Erickson
伊利诺伊大学 Jeff Erickson 教授的算法课教材，免费在线开放。
算法与计算机科学上首页 5 次 · 2018–2022jeffe.cs.illinois.edu编辑精选