Salmanasmat
Sorting Algorithms Visualizer
š
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
ā¶ Start Sorting
š² Randomize
ā¹ Stop
Pace
Random
Reversed
Nearly Sorted
Duplicates
Small Set
Large Set
Comparisons
0
Swaps
0
Time
0
ms
ā” Speed Ranking
1st
Merge Sort
O(n log n)
2nd
Quick Sort
O(n log n)
3rd
Heap Sort
O(n log n)
4th
Insertion Sort
O(nĀ²)
š¾ Memory Ranking
1st
Bubble Sort
O(1)
1st
Selection Sort
O(1)
3rd
Quick Sort
O(log n)
4th
Merge Sort
O(n)
šÆ Best Use Cases
Nearly Sorted
Insertion Sort
Large Datasets
Merge Sort
Memory Limited
Heap Sort
General Purpose
Quick Sort
š Detailed Complexity Comparison
Algorithm
Best
Average
Worst
Space
Stable
Merge Sort
O(n log n)
O(n log n)
O(n log n)
O(n)
Yes
Quick Sort
O(n log n)
O(n log n)
O(nĀ²)
O(log n)
No
Heap Sort
O(n log n)
O(n log n)
O(n log n)
O(1)
No
Insertion
O(n)
O(nĀ²)
O(nĀ²)
O(1)
Yes