Skip to main content
ZhimaYuandi
Data Size:

Bubble Sort

O(n²)
IdleTime 0msCmp 0Swap 0

Selection Sort

O(n²)
IdleTime 0msCmp 0Swap 0

Insertion Sort

O(n²)
IdleTime 0msCmp 0Swap 0

Shell Sort

O(n^1.3~2)
IdleTime 0msCmp 0Swap 0

Merge Sort

O(n log n)
IdleTime 0msCmp 0Swap 0

Quick Sort

O(n log n)
IdleTime 0msCmp 0Swap 0

Heap Sort

O(n log n)
IdleTime 0msCmp 0Swap 0

Counting Sort

O(n+k)
IdleTime 0msCmp 0Swap 0

Time Leaderboard

Click "Run" or "Run All" to start. Completed results appear here in real time.

All algorithms share the same random input and run simultaneously. Timing uses performance.now; comparison / swap counts are device-independent stability metrics for fair comparison.