| Algorithms | Best Time Complexity | Average Time Complexity | Worst Time Complexity | Space Complexity |
|---|---|---|---|---|
| Bubble Sort | Ω(n) | θ(n^2) | O(n^2) | O(1) |
| Selection Sort | Ω(n^2) | θ(n^2) | O(n^2) | O(1) |
| Insertion Sort | Ω(n) | θ(n^2) | O(n^2) | O(1) |
| Heap Sort | Ω(n log(n)) | θ(n log(n)) | O(n log(n)) | O(1) |
| Shell Sort | Ω(n log(n) | θ(n log(n) | O(n^2) | O(1) |
| Quick3 Sort | Ω(n log(n)) | θ(n log(n)) | O(n^2) | O(log(n)) |
| Quick Sort | Ω(n log(n)) | θ(n log(n)) | O(n^2) | O(log(n)) |
| Merge Sort | Ω(n log(n)) | θ(n log(n)) | O(n log(n)) | O(n) |
| Count Sort | Ω(n+k) | θ(n+k) | O(n+k) | O(k) |
| Radix Sort | Ω(nk) | θ(nk) | O(nk) | O(n+k) |
** where n is the length of the array and k is constant