Time complexity table for all algorithm
Sorting Algorithms Best Average worst
Selection Sort Ω(n^2) θ(n^2) O(n^2)
Bubble Sort Ω(n) θ(n^2) O(n^2)
Insertion Sort Ω(n)) θ(n^2) O(n^2)
Heap Sort Ω(n log(n)) θ(n log(n)) O(n log(n))
quick Sort Ω(n log(n))) θ(n log(n)) O(n^2)
merge Sort Ω(n log(n)) θ(n log(n)) O(n log(n))
Bucket Sort Ω(n+k) θ(n+k) O(n^2)
Redix Sort Ω(nk) θ(nk) O(nk)
Count Sort Ω(n+k) θ(n+k) O(n+k)