Algorithm, Review, Sorting
summary
Covers insertion, bubble, quicksort, heap sort and linear and binary search with live demos and working code on GitHub and the Google PHP App Engine; states PHP's sort uses quicksort and shows quicksort’s average O(n log n) and worst O(n^2) on already ordered input; builds heaps with the SPL MinHeap class and explains heap sort’s predictable O(n log n); notes insertion sort is adaptive with best case O(n) and worst O(n^2); mentions radix sort (1887) can be O(n) given suitable data.
AI-written summary · about
chapters (24)
- 0:00Introduction
- 1:34Who am I
- 2:53What this talk is about
- 4:21Why sort data
- 5:59Stable vs Unstable Sorting
- 8:48Big O notation
- 10:00Linear growth
- 12:32Adaptive
- 18:03Insert Sort Recap
- 23:48Knuth
- 24:32Bubble Sort
- 25:18Quick Sort
- 27:16Pivot Index
- 28:32Recursive
- 30:09Quicksort
- 38:18Sorting the array
- 39:45SPLM
- 40:30Sequential Search
- 41:17Binary Search
- 42:34Binary Search Example
- 43:01Binary Search Summary
- 44:00Sorting Algorithms
- 45:04Google of PHP
- 45:24Other sorting algorithms
