Sorting Algorithms - Visualization(Tool)

Note!
The red bar(bar4) is an unsorted value, the green bar(bar2) is a value being sorted, the yellow bar(bar3) is the other value being evaluated against the green bar and the blue bar(bar 1) is the current index.
This site should allow you to Visualize sorting algorithms with any list of your choice.Please note,the loop has been slowed down so the time shown is obviously not accurate/fast, also, the time it takes will be based on your computer speed and also the JS load from this site. Nothing is 100% accurate as this is just a fun visualization tool.
If you are on mobile, you might need to click every input twice for it to respond.
Visualization for merge sort and quick sort will be adjusted soon.
More sorts coming soon.
A few other features will be added soon.
Click the X button on the right to hide this pop-up.

Current Values

Alter List

Insert/Remove a value to/from the the list

Select your preferred sorting method

Start or stop sorting

More sorting stats

Algorithms Info

Name Time complexity Space complexity Details
Bubble sort Best: O(n), Average: O(n^2), Worst: O(n^2) O(1) Stable | Exchanges values
Selection sort Best: O(n^2), Average: O(n^2), Worst: O(n^2) O(n) Not stable | Selects values and puts them into place
Insertion sort Best: O(n), Average: O(n^2), Worst: O(n^2) O(1)) Stable | Inserts values to the right position
Merge sort Best: O(n log n), Average: O(n log n), Worst: O(n log n) O(n) Stable | Uses merging
Quick sort Best: O(n log n), Average: O(n log n), Worst: O(n^2) O(log n) The best, used by most languages as the default sort method | Not stable | Uses partions | In-place

More controls