I made this to show what is happening in each sorting algorithm, and to visualize them in action.
Included:
Merge Sort
Heap Sort
Quick Sort
Bubble Sort
Insertion Sort
Selection Sort
Optimized Selection Sort
Notes
Optimized selection sort is not really a well known sorting algorithm. I noticed that the
common selection sort could also keep track of the highest index, therefore resulting
in a time complexity cut in half. Obviously, merge sort and quick sort are still better,
but it was fun to create my own algorithm.