Sorting Algorithm Lectures

This lecture series introduces sorting algorithms and their time and space complexity, then examines multiple methods including selection, bubble, cocktail-shaker, odd-even, merge, cycle, quick, bitonic, heap, insertion, and shell sort.

Syllabus

What is a Sorting Algorithm? (Sorting Algorithms Mini-Series - Episode 0).
Time and Space Complexity (Sorting Algorithms Mini-Series - Episode 1).
Selection Sort - Sorting Algorithms Mini Series (Episode 2).
Bubble Sort - Sorting Algorithms Mini-Series (Episode 3).
Cocktail-Shaker Sort - Sorting Algorithms Mini-Series (Episode 4).
Odd-Even Sort - Sorting Algorithms Mini-Series (Episode 5).
Merge Sort - Sorting Algorithms Mini-Series (Episode 6).
Cycle Sort - Sorting Algorithms Mini-Series (Episode 7).
QuickSort - Sorting Algorithms Mini-Series (Episode 8).
Bitonic Sort - Sorting Algorithms Mini-Series (Episode 9).
HeapSort - Sorting Algorithms Mini-Series (Episode 10).
Insertion Sort - Sorting Algorithms Mini-Series (Episode 11).
ShellSort - Sorting Algorithms Mini-Series (Episode 12).