TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Algorithms

624 点作者 rsandhu超过 8 年前

26 条评论

tomwphillips超过 8 年前
This is an excellent course and helped me get my current job.<p>My background is chemistry&#x2F;chemical engineering. I had applied for a data scientist position. Phone interview included a problem where I was asked about my solution&#x27;s complexity. I admitted I didn&#x27;t know about it.<p>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.<p>I also found it useful to implement all the algorithms in Python.
评论 #13654279 未加载
评论 #13654524 未加载
hal9000xp超过 8 年前
It&#x27;s strange they didn&#x27;t cover dynamic programming at all. IMO every course should include at least one classical example of dynamic programming. For example:<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Longest_increasing_subsequence" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Longest_increasing_subsequence</a><p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Longest_common_subsequence_problem" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Longest_common_subsequence_pro...</a>
评论 #13654496 未加载
评论 #13654131 未加载
评论 #13660526 未加载
评论 #13654978 未加载
SEJeff超过 8 年前
For anyone wanting to learn algorithms from one of the other heavyweights, not being a C developer, I found this series extremely beneficial:<p><a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithms-Parts-1-4-Fundamentals-Structures&#x2F;dp&#x2F;0201314525" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithms-Parts-1-4-Fundamentals-Str...</a><p>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.
评论 #13654122 未加载
评论 #13654300 未加载
b3b0p超过 8 年前
The Coursera Stanford [0] and Princeton [1] courses start again soon, February 20 to be exact. Not sure which one is better, but to refresh my atrophied CS skills of 10 years I&#x27;ve joined the Stanford course. Not sure how it compares to the Khan Algorithms course. Anyone have any feedback?<p>[0] <a href="https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithm-design-analysis&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithm-design-analysis&#x2F;</a><p>[1] <a href="https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithms-part1&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithms-part1&#x2F;</a>
评论 #13656888 未加载
评论 #13656852 未加载
imakecomments超过 8 年前
As a follow up to this resource I recommend,<p>Algorithms unlocked: <a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithms-Unlocked-Press-Thomas-Cormen&#x2F;dp&#x2F;0262518805" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithms-Unlocked-Press-Thomas-Corm...</a><p>CLRS: <a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;Introduction-Algorithms-3rd-MIT-Press&#x2F;dp&#x2F;0262033844&#x2F;ref=pd_sbs_14_img_0?_encoding=UTF8&amp;psc=1&amp;refRID=8N4X7T2JSRBSJYSVSBCM" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;Introduction-Algorithms-3rd-MIT-Press...</a><p>Both include the same author as the one in this article (Thomas Cormen).
vga805超过 8 年前
Another great resource I highly recommend: <a href="https:&#x2F;&#x2F;www.manning.com&#x2F;books&#x2F;grokking-algorithms" rel="nofollow">https:&#x2F;&#x2F;www.manning.com&#x2F;books&#x2F;grokking-algorithms</a>
评论 #13654394 未加载
Apocryphon超过 8 年前
The Algorithm Design Manual by Skiena is pretty great.<p><a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithm-Design-Manual-Steven-Skiena&#x2F;dp&#x2F;1848000693&#x2F;ref=sr_1_1?ie=UTF8&amp;qid=1487232535&amp;sr=8-1" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithm-Design-Manual-Steven-Skiena...</a><p>It&#x27;s nearly a third of the length of CLRS, and half of Sedgwick. Much more precise, yet offers more in that it talks about common problem solving uses cases with data structures and algorithms, rather than writing going through the theoretical proofs behind them.
评论 #13658734 未加载
bhu1st超过 8 年前
Here is Princeton&#x27;s Algorithm text I&#x27;ve found useful (The code is in JAVA though): <a href="http:&#x2F;&#x2F;algs4.cs.princeton.edu&#x2F;home&#x2F;" rel="nofollow">http:&#x2F;&#x2F;algs4.cs.princeton.edu&#x2F;home&#x2F;</a><p>Pair this up with this excellent lecture by the authors Sedgewick and Wayne: <a href="https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithms-part1&#x2F;home&#x2F;welcome" rel="nofollow">https:&#x2F;&#x2F;www.coursera.org&#x2F;learn&#x2F;algorithms-part1&#x2F;home&#x2F;welcome</a>
ofek超过 8 年前
Somewhat germane, <a href="https:&#x2F;&#x2F;github.com&#x2F;patmorin&#x2F;ods" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;patmorin&#x2F;ods</a> is a great resource for data structures.
awesomepantsm超过 8 年前
Talked to someone who wanted to work at one of the big megacorps as a software engineer, asked for advice to pass the interview. I asked them if they could implement quicksort. They said maybe, but they didn&#x27;t really want to study algorithms. I guess they really didn&#x27;t want the job after all.
malloreon超过 8 年前
If you have the KA app installed this link opens in it!<p>Which is great, except it takes you to the main list of subject matters, and algorithms isn&#x27;t in there.<p>So I&#x27;m not able to view this link on my iPad unless I uninstall KA?
评论 #13654699 未加载
fahimulhaq超过 8 年前
We at educative.io re-published this course as a free course with implementations in Java, C++ and Python (in addition to Javascript).<p><a href="https:&#x2F;&#x2F;www.educative.io&#x2F;collection&#x2F;10370001&#x2F;760001" rel="nofollow">https:&#x2F;&#x2F;www.educative.io&#x2F;collection&#x2F;10370001&#x2F;760001</a><p>One of the authors - Professor Balkcom is our advisor as well.
j2kun超过 8 年前
I understand that the focus on sorting is to have a simple application that everyone can understand. But I can&#x27;t seriously expect people to get that excited about sorting. I sure didn&#x27;t. It&#x27;s not like we don&#x27;t have tons of other applications that demonstrate the same principles.
godmodus超过 8 年前
I have to applaud the attempt.<p>And I&#x27;m kind of smirking right now, because again asymptotic got butchered.<p>I&#x27;ve spent the good part of this semester trying to get my head around a very formal, very dense script of my own algorithms course. And I finally cracked asymptotic. Maybe I&#x27;m just dense. But If that&#x27;s the case, I&#x27;m sharing a classroom with others who are equally dense.<p>We dealt with all 5 classes, big oh, small oh, theta, big omega and little omega. We&#x27;re required to always give the &quot;most exact&quot; classification for best&#x2F;avg&#x2F;worst. Including &quot;does not get as fast as&quot; or &quot;does not get as slow as&quot;<p>I&#x27;m willing to write a &quot;freshman friendly&quot; write up if someone&#x27;s willing to post it or use it. I&#x27;m shit at self publishing.
girzel超过 8 年前
My high-school-age daughter is using Khan Academy to learn about logarithms for her math class. She was telling me about it, and I thought &quot;hmm, maybe I should finally figure out what Big-O actually means&quot;. Now here we are! I guess we&#x27;ll both be on KA tonight.
koolba超过 8 年前
It&#x27;s hard to pick one thing to tell budding developers they have to learn but Big-O notation is definitely up there.<p>The follow up to that is understanding what you&#x27;re counting and why, i.e. branches v.s. statements v.s. dereferences v.s. logical I&#x2F;Os v.s. physical I&#x2F;Os ...
OJFord超过 8 年前
Am I the only one to think that, for anyone capable of making it through the course, the introduction is incredibly patronising?<p>Not just the everyday examples of what constitutes an algorithm, but the voice, presentation, etc.
contravariant超过 8 年前
Odd choice to start with the iterative factorial before moving on to the recursive one. Usually it&#x27;s the other way around, since the iterative algorithm is faster and uses less memory.
评论 #13654939 未加载
bogomipz超过 8 年前
I&#x27;m a big fan of Kahn and I like the addition of CS material to the site. I hope they continue to add CS material.
uber1geek超过 8 年前
So what are some good resources for Data Structures out there, you can vouch for ?
evahop超过 8 年前
Can anyone recommend an alternative introduction to asymptotic notation?
评论 #13655057 未加载
ankurdhama超过 8 年前
It is really sad that people still start the discussion about algorithms by telling it as a sequence of actions or operations to accomplish a task. How to go to airport is not an algorithm, how to cook food is not an algorithm.
评论 #13658058 未加载
Kimalsi超过 8 年前
as someone who doesn&#x27;t know much about this and is trying to join the tech community, what will I achieve through this?
评论 #13653946 未加载
评论 #13654021 未加载
评论 #13654472 未加载
评论 #13654365 未加载
评论 #13653973 未加载
评论 #13653950 未加载
评论 #13654003 未加载
评论 #13654226 未加载
评论 #13653929 未加载
评论 #13654647 未加载
评论 #13654146 未加载
评论 #13654097 未加载
wopwopwop超过 8 年前
Thanks for the link. However, it seems just a subset of Cormen et al.
bigdataanswers超过 8 年前
why python???? ... any language with functions will do. I mean just create a java class with all public static functions if you want it to work like python (global functions). Its really language agnostic. Your answer will be a number a string or a list of things. All languages can do that.<p>Im making an explicit opinion that python is no better than any other language for implementing algorithms. HN please prove me wrong in an objective way so we may all learn?
评论 #13657545 未加载
评论 #13654469 未加载
评论 #13654497 未加载
评论 #13654500 未加载
评论 #13654646 未加载
评论 #13659759 未加载
评论 #13654673 未加载
评论 #13659619 未加载
评论 #13659268 未加载
oferzelig超过 8 年前
Unbelievable, a guy posts a link to some course and gets 458 HN upvotes (as of this writing).