Category: sort algo

Time Complexities of sorting algorithms

Algorithm Time Complexity Best case Average case Worst case Bubble Sort Ω(n) θ(n2) O(n2) Bucket Sort Ω(n+k) θ(n+k) O(n2) Heap Sort Ω(n log(n)) θ(n log(n)) O(n log(n)) Insertion Sort Ω(n) θ(n2) O(n2) Merge Sort Ω(n log(n)) θ(n log(n)) O(n log(n)) Quick Sort Ω(n log(n)) θ(n log(n)) O(n2) Radix Sort Ω(nk) θ(nk) O(nk) Selection Sort Ω(n2) […]