Algorithms Demystified
summary
Live demos show a ten-person bubble sort demo with 10 volunteers to illustrate stability and the early-exit optimization; comparisons of quick sort, TimSort, shell, insertion show quicksort usually wins but libraries switch to insertion on degenerate inputs. Big-O explanations include O(1), O(n), O(n^2) with the triangular-count example. Dijkstra appears as a pub‑crawl shortest‑path example (and underpins map routing). Levenshtein distance powers deterministic spellcheck suggestions; a JavaScript timeout sort (setTimeout) is presented as a humorous non‑solution.
AI-written summary · about
chapters (14)
- 0:00Introduction to algorithms
- 1:34Defining algorithms
- 5:18Algorithms as tools
- 7:07Recursion explained
- 10:15Sorting and searching
- 12:48Binary search demonstration
- 16:03Space complexity
- 17:53Bubble sort demonstration
- 26:04Big O notation
- 32:14Advanced sorting algorithms
- 36:40Timeout sort quirk
- 37:53Spellchecking with Levenshtein
- 40:56Dijkstra's algorithm
- 47:23Conclusion
related talks
55mBack to Basics: Algorithmic Complexity
32mFrom Zero To Binary Search Tree
21mAlgorithms and Their Habitat
45mYou need to know Algorithms and Data Structures in Front-end anyway
01h 00mBack to Basics: (Range) Algorithms in C++
27mFrom Zero to Binary Search Tree
45mYou need to know Algorithms and Data Structures in Front-end, anyway
01h 02mBack to Basics: Classic STL