visual-sort

Visualisation of popular sorting algorithms. Made with processing and javascript. Works well on desktop as well as mobile.

To run locally,

1. clone repo
2. run index.html
3. to view and edit the code, open the repo using an ide.

Current List:

1. selection sort O(n*n)
2. bubble sort O(n*n)
3. quick sort O(n*n) worst case, O(n logn) average case
4. heap sort O(n logn)
5. merge sort O(n logn)

link to simulation - VISUAL_SORT