Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Sorting Algorithms using Java & C: Make Your Basics Strong
Section 1-Introduction
Introduction (3:40)
Join in Our Private Facebook Group
Section 2- Efficiency of algorithm
Introduction to the concept of efficiency of algorithm. (5:32)
Mathematical Approach for calculating efficiency (3:21)
How to estimate for efficiency - Big-Oh notation. (5:39)
Calculating Big-Oh (7:06)
Calculating Big-Oh continue... (8:40)
Calculating Big-Oh more examples (6:36)
Best case complexity (7:51)
Average case complexity (5:11)
Section 3-Bubble Sort
Bubble sort logic. (13:54)
Analysis of bubble sort - Worst case complexity (4:24)
Improve bubble sort algorithm for best case (7:04)
Implementation of bubble sort using C - Part 1, Understand the helper functions (3:07)
Implementation of bubble sort using C - Part 2 Writing the function. (7:09)
Implementation of bubble sort using C - Part 3 Testin (6:57)
Implementation of bubble sort using C - Part 4, how it behaves on sorted input. (2:35)
Implementation of bubble sort using Java - Part 1 (10:11)
Implementation of bubble sort using Java - Part 2 (5:55)
Implementation of bubble sort using Java - Part 3 (2:12)
Selection Sort
Understand Selection Sort logic and develop the algorithm (9:50)
Analysis of selection sort (4:00)
Implementation of selection sort using C (4:55)
Implementation of selection sort using Java (7:08)
Section 5-Insertion Sort
Introduction to insertion sort, understanding the logic using visual description (11:50)
Insertion sort on sorted array as input (2:17)
Worst case behaviour of insertion sort. (4:35)
Implementation of insertion sort using C (3:40)
Implementation of insertion sort using Java (3:52)
Section 6-Shell Sort
Introduction to Shell Sort, understand the logic with visual description. (10:21)
Algorithm of Shell Sort (4:14)
Implementation of Shell Sort using C (7:34)
Implementation of Shell Sort using Java (7:04)
Section 7-Quick Sort
Quick Sort introduction. (1:54)
Quick sort procedure with visual description. (8:30)
Partition logic. Understand clearly how partition logic works (7:14)
Dry run of Partition logic algorithm. (10:27)
Analysis of quick sort - average case execution time. (12:07)
Analysis of quick sort - worst case, when the input is sorted. (5:56)
Analysis of quick sort - space complexity (3:01)
Implementation of Quick sort using C (8:41)
Implementation of Quick sort using Java (8:06)
Section 8-Merge Sort
Introduction to Merge Sort (1:22)
Merge logic - How to merge two sorted halves of same array into one sorted array (9:00)
Merge sort procedure (6:40)
Analysis of merge sort. (10:18)
Implementation of merge sort using C (6:12)
Implementation of merge sort using Java (7:15)
Section 9-Heap data structure and Heap sort
Introduction to heap sort. (2:06)
Brief idea of Binary Tree (5:02)
Almost complete binary tree. (2:03)
How to representation of almost complete binary tree using 1 dimensional array. (6:03)
Definition of Heap. (4:17)
How to insert into heap. (11:12)
How to delete from heap (9:14)
Heap adjust. (7:42)
Heapify - build a heap from any arbitrary array. (8:52)
Heap sort - understand how we can sort an array using a heap. (6:31)
Implementation of heap sort using C (15:50)
Implementation of heap sort using Java (11:59)
Analysis of quick sort - average case execution time.
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock