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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Algorithms tutorial series for beginners

177 点作者 adriansky超过 6 年前

3 条评论

01100011超过 6 年前
Curious if anyone knows of a short overview of CS or Engineering topics(i.e. linear algebra, diff eqs, etc) for keeping refreshed as you age. I&#x27;m not talking about a full tutorial, more like something you could scan through every few years just to make sure you&#x27;re not forgetting the important stuff that you haven&#x27;t used since college.<p>As a side note, I recently interviewed with a couple companies in the valley and the focus of the interviews was not on &#x27;gotcha&#x27; algorithm questions. There were a few, but I came away feeling that the process was more fair and reasonable than I&#x27;d been led to believe. Now, granted, I&#x27;m an embedded software guy and maybe they tailored the questions for me, but I feel like I wasted a month going over graph algorithms. It was a good learning experience, but my time would have been better spent reviewing more basic embedded topics.
评论 #18242973 未加载
评论 #18244047 未加载
评论 #18244427 未加载
评论 #18241565 未加载
评论 #18242722 未加载
herodotus超过 6 年前
&gt;A math genius called Alan Turing joined the British military to crack the German “Enigma” code. He knew they would never get ahead if they keep doing the calculations by pen and paper. So after many months of hard work, they built a machine. Unfortunately, It took more than a day to decode a message! So, it was useless :((((<p>I could not read past this. Yet another distortion of what was done at Bletchley Park. Yes, I understand, keep your readers interested, but not by making up stuff and claiming it was real. I think the author should find a better example of an import use of algorithms than this one.
评论 #18242425 未加载
评论 #18243533 未加载
sigi45超过 6 年前
Liked your writeup on balancing trees :-)<p>My biggest issue: The amount! You can do more algorithm and datastructres! Greedy, Divide and Conquer etc.