A Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of element in the respective data structure read more.
This project implements the following sorting algorithms:
- Bubble sort
- Insertion sort
- Selection sort
- Quick sort
- Shell sort - Knuth Sequence
- Cocktail shaker sort
- Counting sort
- Merge sort
- Heap sort
- Radix sort
- Bitonic sort
- Quick Sort - Hoare Partition scheme
- Dealer
- Musa Kanneh
- David Mutune