// Select an algorithm to see its code
Select an algorithm and click visualize to see the explanation of each step.
| Algorithm | Worst-Case Time | Average-Case Time | Best-Case Time | Space Complexity | Stable |
|---|---|---|---|---|---|
| Bubble Sort | O(n²) | O(n²) | O(n) | O(1) | Yes |
| Insertion Sort | O(n²) | O(n²) | O(n) | O(1) | Yes |
| Selection Sort | O(n²) | O(n²) | O(n²) | O(1) | No |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | O(n) | Yes |
| Quick Sort | O(n²) | O(n log n) | O(n log n) | O(log n) | No |
| Heap Sort | O(n log n) | O(n log n) | O(n log n) | O(1) | No |
| Radix Sort | O(nk) | O(nk) | O(nk) | O(n+k) | Yes |
| Counting Sort | O(n+k) | O(n+k) | O(n+k) | O(k) | Yes |
| Bucket Sort | O(n²) | O(n) | O(n) | O(n+k) | Yes |
| Shell Sort | O(n log² n) | O(n log n) | O(n log n) | O(1) | No |