Best Algorithms & data structures Videos
「Algorithms & data structures」下面有60部被不同的人、在不同月份推荐过的视频。挑的时候先看对象:入门6部,适合还没学过的人;进阶24部,适合已经懂术语的人;普通向16部,按兴趣就能看;更硬的14部,留给想看推导或细节的人。这一类数量最多的是演讲,所以它们的共同点是一位讲者把一个判断讲完,例子是为了撑住这个判断。常出现的频道包括CppCon、Google TechTalks、CGP Grey。目录给这个主题划的范围是:Algorithms and data structures: sorting, graphs, hash tables, trees, dynamic programming, competitive programming, MIT 6.006, algorithm analysis, Big-O, clever algorithms.如果只看三部,就从《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》,留给已经有基础的人。页面按每页24部切开,顺序看的是被推荐跨越了多少个月,不是播放量。每条标题下面那一句是这部片子自己的内容说明,用来区分它在讲定义、过程、演示还是观点。点进去能看到推荐原话、原文链接和适合谁看。看的时候把强烈推荐当成有人明确叫你去看,把引用当成只是拿来举例,把批评留下来对照,不要把每条评论都当成同一力度。

Solving Wordle using information theory
3Blue1Brown uses Wordle as an excuse to teach information theory and entropy, building a solver that picks guesses by expected information and incorporating word frequencies.

'Fastware' - Andrei Alexandrescu [ ACCU 2016 ]
Andrei Alexandrescu's ACCU 2016 talk previews material from his book on writing fast code, with a focus on optimization techniques such as sentinels and faster search.

Succinct Data Structures
Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries.

Find the Longest Path
Find the Longest Path is a comedic song by Daniel J.

H3: Tiling the Earth with Hexagons
Uber Engineering's Joseph Gilley explains why Uber uses hexagons for geospatial indexing and introduces H3, its open source hierarchical grid system.

Someone improved my code by 40,832,277,770%
Matt Parker follows the community effort to speed up his slow Wordle-solving code, which ended up running hundreds of millions of times faster.

SORTDEMO.BAS
A three-minute capture of SORTDEMO.BAS, the sorting visualization that shipped with QBasic.

CppCon 2016: Chandler Carruth “High Performance Code 201: Hybrid Data Structures"
Chandler Carruth's CppCon 2016 talk on designing hybrid data structures for performance.

Winning at programming competitions is a negative factor for being good on the job
A one-minute clip of Peter Norvig saying that Google found programming contest success correlates negatively or poorly with job performance.

Sparse Voxel Octree (SVO) Demo by Jon Olick
A short demo of real-time sparse voxel octree rendering, shown by Jon Olick at Siggraph 2008.

Barack Obama - Computer Science Question
A one-minute clip from Barack Obama's 2008 Google visit in which Eric Schmidt asks him the most efficient way to sort a million 32-bit integers.

The Shortest-Splitline Algorithm: a Gerrymandering Solution [Bonus Video]
A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population.