30 Sorting Algorithms - Reversed Input (seizure warning at bogo & bozo sorts)
30 sorting algorithms done in reverse input.
Chapters:
0:00 Selection Sort (100 numbers)
0:27 Insertion Sort (100 numbers)
1:15 Binary Insertion Sort (128 numbers)
2:10 Merge Sort (1024 numbers)
3:38 Quick Sort, LR ptrs (100 numbers)
3:56 Quick Sort, LL ptrs (100 numbers)
4:29 Ternary Quick Sort, LR ptrs (100 numbers)
4:48 Ternary Quick Sort, LL ptrs (100 numbers)
5:21 Dual Pivot Quick Sort (100 numbers)
5:31 Bubble Sort (80 numbers)
6:12 Cocktail Shaker Sort (100 numbers)
7:07 Gnome Sort (80 numbers)
7:57 Comb Sort (400 numbers)
8:45 Shell Sort (400 numbers)
9:14 Heap Sort (350 numbers)
10:00 Smooth Sort (250 numbers)
10:30 Odd-Even Sort (128 numbers)
12:13 Bitonic Sort (512 numbers)
13:39 Cycle Sort (128 numbers)
14:00 LSD Radix Sort (1536 numbers)
14:46 MSD Radix Sort (1536 numbers)
15:50 VIDEO EDITING GOOF-UP :/
15:58 Intro Sort (768 numbers)
17:48 Stable Sort (768 numbers)
18:08 std:sort_heap (900 numbers)
19:12 Tim sort (300 numbers)
19:17 Wiki Sort (1024 numbers)
19:55 Bogo Sort (8 numbers)
20:21 Bozo Sort (8 numbers)
20:40 Stooge Sort (50 numbers)
21:28 Slow Sort (75 numbers)