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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Ask HN: Best resource to learn applications of algorithms

19 点作者 chedine大约 3 年前
Lot of resources to learn classic and modern algorithms and data structures. But is there a good resource guide on how they are applied. Especially the non obvious applications? For example when i learnt shortest path algo is used in context aware image resizing, my mind was wow, thats clever. Is there a good collection of such applications?

3 条评论

sitkack大约 3 年前
It is usually in the optimization of some problem.<p>Bin packing (loading transport, scheduling), min&#x2F;max of a function, least steps, least travel. One of the big applications of early computers were in ballistics tables and cut and fill for road and rail lines. Another being scheduling (classes, specialized staff, etc).<p>If you can&#x27;t find problems to apply your algorithm knowledge to, I&#x27;d recommend compilers and 3d printing&#x2F;design.<p><a href="http:&#x2F;&#x2F;www.learncivilengineering.com&#x2F;wp-content&#x2F;uploads&#x2F;2014&#x2F;06&#x2F;Excavation-and-embankment-e.g.-cut-and-fill.pdf" rel="nofollow">http:&#x2F;&#x2F;www.learncivilengineering.com&#x2F;wp-content&#x2F;uploads&#x2F;2014...</a><p><a href="https:&#x2F;&#x2F;hrcak.srce.hr&#x2F;file&#x2F;172575" rel="nofollow">https:&#x2F;&#x2F;hrcak.srce.hr&#x2F;file&#x2F;172575</a><p>I recommend checking out Skiena&#x27;s &quot;Algorithm Design Manual&quot; [1] if you haven&#x27;t already.<p>[1] <a href="https:&#x2F;&#x2F;www.algorist.com&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.algorist.com&#x2F;</a><p>[2] <a href="https:&#x2F;&#x2F;www.algorist.com&#x2F;algowiki&#x2F;index.php&#x2F;Chapter_10#Design_Problems" rel="nofollow">https:&#x2F;&#x2F;www.algorist.com&#x2F;algowiki&#x2F;index.php&#x2F;Chapter_10#Desig...</a>
评论 #30784853 未加载
nso95大约 3 年前
Algorithmic Thinking might be what you&#x27;re looking for - <a href="https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithmic-Thinking-Problem-Based-Daniel-Zingaro-ebook&#x2F;dp&#x2F;B085BVJ51Z&#x2F;ref=sr_1_3?crid=2VZI7RYE7L5J8&amp;keywords=algorithmic+thinking&amp;qid=1648077507&amp;sprefix=algorithmic+thinking%2Caps%2C81&amp;sr=8-3" rel="nofollow">https:&#x2F;&#x2F;www.amazon.com&#x2F;Algorithmic-Thinking-Problem-Based-Da...</a>
eatonphil大约 3 年前
Try finding an entry in a list of 100 elements. Then try finding an entry in a list of 10 million elements.<p>Then make a hash table out of the list and try finding an entry in the hash table of 100 elements and the hash table of 10 million elements.<p>If you want to take it further, try building an in-memory database. Benchmark how it works with and without indexes as the number of items in the database grows.