YoVDO

Sorting Algorithm Lectures

Offered By: YouTube

Tags

Algorithms and Data Structures Courses Bubble Sort Courses QuickSort Courses Merge Sort Courses Selection Sort Courses Sorting Algorithms Courses Algorithm Analysis Courses Time Complexity Courses Space Complexity Courses

Course Description

Overview

Dive into a comprehensive lecture series on sorting algorithms, exploring their fundamentals, time and space complexity, and various implementations. Learn about popular algorithms such as Selection Sort, Bubble Sort, Merge Sort, QuickSort, and HeapSort, as well as lesser-known variants like Cocktail-Shaker Sort, Odd-Even Sort, and Bitonic Sort. Gain a deep understanding of each algorithm's mechanics, efficiency, and practical applications through detailed explanations and examples spread across 13 episodes.

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).


Taught by

NullPointer Exception

Related Courses

Design of Computer Programs
Stanford University via Udacity
Algorithms, Part I
Princeton University via Coursera
Algorithms, Part II
Princeton University via Coursera
Intro to Algorithms
Udacity
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera