| Quick Sort |
O(n log n) |
O(n log n) |
O(n²) |
O(log n) |
No |
Large datasets |
| Merge Sort |
O(n log n) |
O(n log n) |
O(n log n) |
O(n) |
Yes |
Stable sorting with guaranteed efficiency |
| Heap Sort |
O(n log n) |
O(n log n) |
O(n log n) |
O(1) |
No |
Worst-case efficiency |
| Bubble Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
Yes |
Small nearly sorted datasets |
| Selection Sort |
O(n²) |
O(n²) |
O(n²) |
O(1) |
No |
Minimal swaps |
| Insertion Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
Yes |
Small or nearly sorted datasets |
| Gnome Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
Yes |
Simple implementation |
| Shaker Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
Yes |
Optimized Bubble Sort |
| Odd-Even Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
Yes |
Parallel sorting |
| Pancake Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
No |
Theoretical applications |
| Bitonic Sort |
O(log² n) |
O(log² n) |
O(log² n) |
O(n) |
No |
Parallel computing |
| Radix Sort |
O(nk) |
O(nk) |
O(nk) |
O(n + k) |
Yes |
Sorting integers |
| Shell Sort |
O(n log n) |
O(n log² n) |
O(n²) |
O(1) |
No |
Medium-sized datasets |
| Comb Sort |
O(n log n) |
O(n²) |
O(n²) |
O(1) |
No |
Optimized Bubble Sort |
| Bogo Sort |
O(n) |
O((n+1)!) |
O((n+1)!) |
O(1) |
No |
Educational demonstration |
| Stooge Sort |
O(n².71) |
O(n².71) |
O(n².71) |
O(1) |
No |
Theoretical applications |