There are lots of sorting algorithms and some of them are hard to understand, so in this series I will explain all of them, starting in part 1 with those that I consider most important to understand. corrections/clarifications: none so far Chapters: 0:00 Intro 1:04 Selection Sort 1:35 Double Selection Sort 2:01 Insertion Sort 2:38 Binary Insertion Sort 3:27 Bubble Sort 3:59 Shaker Sort 4:21 Asymptotic Notation 7:11 Finding Time Complexity 8:57 Quick Sort 11:22 Merge Sort 12:40 Stability 13:42 Space Complexity 15:28 Heap Sort 18:17 Comb Sort 19:35 Shell Sort 20:59 Radix Sort 24:59 MSD Radix Sort 25:42 Bucket Sort 28:34 Counting Sort 29:52 Spaghetti Sort 30:34 Gravity Sort 32:00 Pancake Sort 33:15 Bogo Sort 34:25 Outro