Visualisation of popular sorting algorithms. Made with processing and javascript. Works well on desktop as well as mobile.
To run locally,
- clone repo
- run index.html
- to view and edit the code, open the repo using an ide.
Current List:
- selection sort O(n*n)
- bubble sort O(n*n)
- quick sort O(n*n) worst case, O(n logn) average case
- heap sort O(n logn)
- merge sort O(n logn)