π Sorting (2D)
Algorithm
Bubble Sort O(nΒ²)
Selection Sort O(nΒ²)
Insertion Sort O(nΒ²)
Shell Sort O(n logΒ² n)
Merge Sort O(n log n)
Quick Sort O(n log n)
Heap Sort O(n log n)
Cocktail Shaker O(nΒ²)
Gnome Sort O(nΒ²)
Counting Sort O(n+k)
Radix Sort O(nk)
Cycle Sort O(nΒ²)
Array size
80
Speed
5
βΆ Sort
π New array
π Sound: ON
Comparisons
0
Swaps
0
Array accesses
0
Time
β
Status
Ready
Unsorted
Comparing
Swapping
Pivot / key
Overwrite
Sorted
Select algorithm Β· Resize array Β· Click Sort Β· Toggle sound