Know your algorithms; sorting and searching
summary
Demos use a PHP Silex app and code pushed to GitHub with a PDF of slides, and the page repeatedly shows visualizers for each algorithm; PHP's sort uses quicksort in C. Insertion sort is in-place, adaptive, stable, online, best O(1) on nearly-sorted data but average/worst O(n²). Bubble sort is academic; quicksort gives average O(n log n) and can be parallelized (worst O(n²)); SPL MinHeap/MaxHeap exists for heap sort; binary search is O(log n); radix can be O(n) for specific data.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:55Who am I
- 2:41Problem solving
- 4:00No other applications
- 5:00Why we do this
- 5:45Sorting first
- 7:25Stability
- 10:45Big O
- 16:57Adaptive algorithms
- 19:01Insertion sort
- 32:16Quicksort
- 37:37Quicksort visualization
- 39:48Quicksort improvements
- 41:38Heapsort
- 42:48Tree
- 45:38Sequential search
- 47:03Binary search
