Mathematics & Theoretical CS
Algorithms & data structures
Algorithms & data structures sits within Mathematics & Theoretical CS. Approach the subject through definitions, worked reasoning, and the connections that make an abstract idea useful. This selection contains 60 catalog videos from 47 distinct channels. The examples below offer specific entry points into the subject, with their own vocabulary and scope, rather than a prescribed sequence of lessons.
Recurring catalog topics include algorithms, c++, performance, cppcon, data structures and hash tables. These tags describe overlapping directions within the collection; an individual video may connect several of them. Recorded formats include comedy, demo, documentary, explainer, lecture, music, podcast, talk and tutorial. Use those differences to choose between approaches to the subject and to compare how different contributors frame related questions.
“CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step””, listed under CppCon, is cataloged as talk. Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data…
“30 Weird Chess Algorithms: Elo World”, listed under suckerpinch, is cataloged as explainer. Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted…
60 videos
