Introduction
- Introduction
Efficiency of algorithm
- Introduction to the concept of efficiency of algorithm.
- Quiz on Efficiency of algorithm
- Mathematical Approach for calculating efficiency
- Quiz on Mathematical Approach
- How to estimate for efficiency - Big-Oh notation.
- Quiz on How to estimate efficiency - Big Oh notation
- Calculating Big-Oh
- Calculating Big - Oh
- Calculating Big-Oh continue...
- Calculating Big-Oh more examples
- More Quiz on Big Oh
- Best case complexity
- Quiz on Best case complexity.
- Average case complexity
Bubble Sort
- Bubble sort logic.
- Analysis of bubble sort - Worst case complexity
- Improve bubble sort algorithm for best case
- Implementation of bubble sort using C - Part 1, Understand the helper functions
- Implementation of bubble sort using C - Part 2 Writing the function.
- Implementation of bubble sort using C - Part 3 Testing
- Implementation of bubble sort using C - Part 4, how it behaves on sorted input.
- Implementation of bubble sort using Java - Part 1
- Implementation of bubble sort using Java - Part 2
- Implementation of bubble sort using Java - Part 3
- Quiz on Bubble Sort
- Bubble Sort Assignment No - 1 using C or Java
- Assignment 2 - Implement 2 way Bubble Sort using Java or C
Selection Sort
- Understand Selection Sort logic and develop the algorithm
- Selection Sort Dry Run
- Analysis of selection sort
- Quiz on selection sort
- Implementation of selection sort using C
- Implementation of selection sort using Java
- Perform selection sort by selecting maximum number
Insertion Sort
- Introduction to insertion sort, understanding the logic using visual description
- Insertion sort on sorted array as input
- Worst case behaviour of insertion sort.
- Quiz on Insertion Sort
- Implementation of insertion sort using C
- Implementation of insertion sort using Java
Shell Sort
- Introduction to Shell Sort, understand the logic with visual description.
- Algorithm of Shell Sort
- Implementation of Shell Sort using C
- Implementation of Shell Sort using Java
Quick Sort
- Quick Sort introduction.
- Quick sort procedure with visual description.
- Partition logic. Understand clearly how partition logic works
- Dry run of Partition logic algorithm.
- Analysis of quick sort - average case execution time.
- Analysis of quick sort - worst case, when the input is sorted.
- Analysis of quick sort - space complexity
- Implementation of Quick sort using C
- Implementation of Quick sort using Java
Merge Sort
- Introduction to Merge Sort
- Merge logic - How to merge two sorted halves of same array into one sorted array
- Merge sort procedure
- Analysis of merge sort.
- Implementation of merge sort using C
- Implementation of merge sort using Java
Heap data structure and Heap sort
- Introduction to heap sort.
- Brief idea of Binary Tree
- Almost complete binary tree.
- How to representation of almost complete binary tree using 1 dimensional array.
- Definition of Heap.
- How to insert into heap.
- How to delete from heap.
- Heap adjust.
- Heapify - build a heap from any arbitrary array.
- Heap sort - understand how we can sort an array using a heap.
- Implementation of heap sort using C
- Implementation of heap sort using Java
BONUS SECTION
- Referral links for my other courses on Udemy : Your next step.
