This course covers a comprehensive overview of various sorting algorithms, including lectures and visualizations. By the end of the course, learners will understand the concept of sorting algorithms, analyze time and space complexity, and be proficient in implementing algorithms such as Selection Sort, Bubble Sort, Merge Sort, QuickSort, and more. The teaching method includes a combination of lectures and visualizations to enhance understanding. This course is suitable for individuals interested in computer science, programming, or algorithm design.
Overview
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).
Visualizing Selection Sort w/ Colors (Sorting Algorithms Mini-Series).
Bubble Sort - Sorting Algorithms Mini-Series (Episode 3).
Visualizing Bubble Sort w/ Colors.
Cocktail-Shaker Sort - Sorting Algorithms Mini-Series (Episode 4).
Visualizing Cocktail-Shaker Sort w/ Colors.
Odd-Even Sort - Sorting Algorithms Mini-Series (Episode 5).
Visualizing Odd-Even Sort w/ Colors.
Merge Sort - Sorting Algorithms Mini-Series (Episode 6).
Visualizing Merge Sort w/ Colors.
Cycle Sort - Sorting Algorithms Mini-Series (Episode 7).
Visualizing Cycle Sort w/ Colors.
QuickSort - Sorting Algorithms Mini-Series (Episode 8).
Visualizing QuickSort w/ Colors.
Bitonic Sort - Sorting Algorithms Mini-Series (Episode 9).
Visualizing BitonicSort (w/ Colors).
HeapSort - Sorting Algorithms Mini-Series (Episode 10).
Visualizing HeapSort w/ Colors.
Insertion Sort - Sorting Algorithms Mini-Series (Episode 11).
Visualizing Insertion Sort (w/ Colors).
ShellSort - Sorting Algorithms Mini-Series (Episode 12).
Taught by
NullPointer Exception
