Every Sorting Algorithm (part 3): Variants and Hybrids

Video Description

This is the 3rd episode in my series explaining every sorting algorithm. In this video, I explain the most widespread hybrid and variant sorting algorithms. part 1: https://youtu.be/AAwYzYkjNTg part 2: https://youtu.be/wqibJMG42Ik Chapters: 0:00 Why Hybrid Algorithms? 2:36 Quick Sort with LL Pointers 3:01 Dual Pivot Quick Sort 3:55 Proportion Extend Sort 4:42 Intro Sort 5:23 Pattern-Defeating Quick Sort 7:08 Tim Sort 8:56 Iterative Merge Sort 10:00 In Place Merge Sort 11:12 Weave Sort 11:30 Rotate Merge Sort 13:01 Quad Sort 14:40 Block Sort 16:18 Weak Heap Sort 19:09 Smooth Sort 22:35 Poplar Sort 23:05 Ternary Heap Sort 23:39 In Place MSD Radix Sort 24:57 Binary Quick Sort 25:21 In Place LSD Radix Sort 26:05 American Flag Sort 27:10 Burst Sort 27:34 Spread Sort 28:31 Sample Sort 29:18 Proxmap Sort 29:37 Cartesian Tree Sort 30:09 Stalin Sort 31:16 Sleep Sort 31:36 Miracle Sort 32:00 Bogobogo Sort 33:04 Power Sort 33:50 Identity Crisis Sort 34:20 Outro Sort #sorting #algorithm #computerscience