This little project is heavily inspired by a video called "15 Sorting Algorithms in 6 Minutes" by Timo Bingmann.
Having seen the video multiple times, I want to implement a sorting algorithm visualizer of my own, but for some reason I never had the chance to complete it until now, that is.
In my version of sorting algorithm visualizer, you can investigate exactly what the algorithm is doing to the input. The visualizer will describe that two elements are being compared, or being swapped, or has been swapped.
So far, common sorting algorithms are included:
- Bubble sort
- Insertion sort
- Selection sort
- Merge sort
- Heapsort
- Quicksort
- Counting sort
Also, the visualizer looks better on tall screens on wide screens for some reason.
Pushing dist/ directory to branch_name branch.
npx gh-pages -d path/to/dist/ -b branch_name- "15 Sorting Algorithms in 6 Minutes" by Timo Bingmann (YouTube): https://www.youtube.com/watch?v=kPRA0W1kECg
Comparison-based sorting algorithms:
- Bubble sort (Wikipedia): https://en.wikipedia.org/wiki/Bubble_sort
- Insertion sort (Wikipedia): https://en.wikipedia.org/wiki/Insertion_sort
- Selection sort (Wikipedia): https://en.wikipedia.org/wiki/Selection_sort
- Merge sort (Wikipedia): https://en.wikipedia.org/wiki/Merge_sort
- Heapsort (Wikipedia): https://en.wikipedia.org/wiki/Heapsort
Non-comparison sorting algorithms:
- Counting sort (Wikipedia): https://en.wikipedia.org/wiki/Counting_sort
- Radix sort (Wikipedia): https://en.wikipedia.org/wiki/Radix_sort
- Radix sort (geeksforgeeks): https://www.geeksforgeeks.org/radix-sort/