Sorting Algorithms using Java & C: Make Your Basics Strong

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Chapter 2: Efficiency of algorithm

Lecture 1: Introduction to the concept of efficiency of algorithm.

Lecture 2: Mathematical Approach for calculating efficiency

Lecture 3: How to estimate for efficiency – Big-Oh notation.

Lecture 4: Calculating Big-Oh

Lecture 5: Calculating Big-Oh continue…

Lecture 6: Calculating Big-Oh more examples

Lecture 7: Best case complexity

Lecture 8: Average case complexity

Chapter 3: Bubble Sort

Lecture 1: Bubble sort logic.

Lecture 2: Analysis of bubble sort – Worst case complexity

Lecture 3: Improve bubble sort algorithm for best case

Lecture 4: Implementation of bubble sort using C – Part 1, Understand the helper functions

Lecture 5: Implementation of bubble sort using C – Part 2 Writing the function.

Lecture 6: Implementation of bubble sort using C – Part 3 Testing

Lecture 7: Implementation of bubble sort using C – Part 4, how it behaves on sorted input.

Lecture 8: Implementation of bubble sort using Java – Part 1

Lecture 9: Implementation of bubble sort using Java – Part 2

Lecture 10: Implementation of bubble sort using Java – Part 3

Chapter 4: Selection Sort

Lecture 1: Understand Selection Sort logic and develop the algorithm

Lecture 2: Analysis of selection sort

Lecture 3: Implementation of selection sort using C

Lecture 4: Implementation of selection sort using Java

Chapter 5: Insertion Sort

Lecture 1: Introduction to insertion sort, understanding the logic using visual description

Lecture 2: Insertion sort on sorted array as input

Lecture 3: Worst case behaviour of insertion sort.

Lecture 4: Implementation of insertion sort using C

Lecture 5: Implementation of insertion sort using Java

Chapter 6: Shell Sort

Lecture 1: Introduction to Shell Sort, understand the logic with visual description.

Lecture 2: Algorithm of Shell Sort

Lecture 3: Implementation of Shell Sort using C

Lecture 4: Implementation of Shell Sort using Java

Chapter 7: Quick Sort

Lecture 1: Quick Sort introduction.

Lecture 2: Quick sort procedure with visual description.

Lecture 3: Partition logic. Understand clearly how partition logic works

Lecture 4: Dry run of Partition logic algorithm.

Lecture 5: Analysis of quick sort – average case execution time.

Lecture 6: Analysis of quick sort – worst case, when the input is sorted.

Lecture 7: Analysis of quick sort – space complexity

Lecture 8: Implementation of Quick sort using C

Lecture 9: Implementation of Quick sort using Java

Chapter 8: Merge Sort

Lecture 1: Introduction to Merge Sort

Lecture 2: Merge logic – How to merge two sorted halves of same array into one sorted array

Lecture 3: Merge sort procedure

Lecture 4: Analysis of merge sort.

Lecture 5: Implementation of merge sort using C

Lecture 6: Implementation of merge sort using Java

Chapter 9: Heap data structure and Heap sort

Lecture 1: Introduction to heap sort.

Lecture 2: Brief idea of Binary Tree

Lecture 3: Almost complete binary tree.

Lecture 4: How to representation of almost complete binary tree using 1 dimensional array.

Lecture 5: Definition of Heap.

Lecture 6: How to insert into heap.

Lecture 7: How to delete from heap.

Lecture 8: Heap adjust.

Lecture 9: Heapify – build a heap from any arbitrary array.

Lecture 10: Heap sort – understand how we can sort an array using a heap.

Lecture 11: Implementation of heap sort using C

Lecture 12: Implementation of heap sort using Java