In this course you will learn about sorting algorithms in C++. From beginner to expert. Every chapter contains a specific sorting algorithm. You will be familiar with comparisan based as well as non-comparison based sorting algorithms. The standard ones such as bubble sort, insertion sort, selection sort, merge sort and quicksort. Of course there are importantnon-comparison based algorithms such as counting sort and radix sort.

Section 1 - Sorting Basics

• why to learn about sorting algorithms

• what is stable sorting?

• what is adaptive sorting?

Section 2 - Bogo Sort

• what is bogo sort?

• O(1) in quantum computing

• Fisher-Yates shuffle algorithm

Section 3 - Bubble Sort

• what is bubble sort?

• how to use quadratic running time algorithms in real-life?

Section 4 - Selection Sort

• what is selection sort?

• how to use the idea of linear search?

Section 5 - Insertion Sort

• what is insertion sort?

• why divide and conquer approaches uses insertion sort as sub-procedure?

Section 6 - Shell Sort

• what is shell sort?

• how to solve the problem of insertion sort?

Section 7 - Non-Comparison Based Sorting

• what is hybrid algorithms?

• what are non-comparison based sorting approaches?

Section 8 - Counting Sort

• what is counting sort?

• how to achieve O(N)linear running time with sorting?

Section 9 - Radix Sort

• what is radix sort?

• what is the state of the art integer sorting approach?

So these are the topics we are going to consider on a one by one basis. Theory and implementation included in C++! After learning about the fundamental sorting approaches, you can take the next step into the field of algorithms and data structures. Let's get started!