#Big O notations of Sort algorithms
Algorithm |
Time Complexity |
Space Complexity |
Name |
Best |
Average |
Worst |
Worst |
Quicksort |
Ω(n log(n)) |
Θ(n log(n)) |
O(n^2) |
O(log(n)) |
Mergesort |
Ω(n log(n)) |
Θ(n log(n)) |
O(n log(n)) |
O(n) |
Heapsort |
Ω(n log(n)) |
Θ(n log(n)) |
O(n log(n)) |
O(1) |
Bubble Sort |
Ω(n) |
Θ(n^2) |
O(n^2) |
O(1) |
Insertion Sort |
Ω(n) |
Θ(n^2) |
O(n^2) |
O(1) |
Selection Sort |
Ω(n^2) |
Θ(n^2) |
O(n^2) |
O(1) |
Shell Sort |
Ω(n log(n)) |
Θ(n(log(n))^2) |
O(n(log(n))^2) |
O(1) |
Radix Sort |
Ω(nk) |
Θ(nk) |
O(nk) |
O(n+k) |
Counting Sort |
Ω(n+k) |
Θ(n+k) |
O(n+k) |
O(k) |