15 Sorting Algorithms in 6 Minutes
推荐理由
just want to quickly share an IMHO interesting sorting algorithm visualization video
说明
这是2013年由Timo Bingmann发布的一部演示,主题归在Algorithms & data structures。它讲的是sorting algorithms这一支里的具体问题,而不是把整个领域扫一遍。适合第一次接触、还没有先修课的人。内容上可以概括成:A visualization and sonification of 15 sorting algorithms, from selection sort to bogo sort, run on shuffled integers in six minutes. Each algorithm gets a size and speed scaled to its complexity.这些读者给出的理由,核心是:A classic that HN points to for seeing how sorting algorithms behave, valued for how satisfying it is to watch and hear.讲法不绑某一条新闻,过几年仍然可以当材料看。从2014年到2023年,有4位不同的读者在4个不同月份把它推荐出来,其中明确叫别人去看的有0次。适合先看结果再决定要不要深挖的人。先看它做成了什么。如果已经会了基本定义,就把注意力放在它怎么把sorting algorithms变成能跟着复述的例子。
视频信息
- 频道
- Timo Bingmann
- 时长
- 5 分 50 秒
- 发布年份
- 2013
同主题更多
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019