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)) … Read more
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)) … Read more