e-
algo____________best___________average___________worst
Quicksort Ω(n log(n))___________ Θ(n log(n))___________ O(n^2)
Mergesort Ω(n log(n)) ___________ Θ(n log(n)) ___________ O(n log(n))
Timsort Ω(n) ___________ Θ(n log(n)) ___________ O(n log(n))
Heapsort Ω(n log(n))___________ Θ(n log(n)) ___________ O(n log(n))
Bubble Sort Ω(n) ___________ Θ(n^2) ___________ O(n^2)
Insertion Sort Ω(n) ___________ Θ(n^2) ___________ O(n^2)
Selection Sort Ω(n^2) ___________ Θ(n^2) ___________ O(n^2)
Tree Sort Ω(n log(n)) ___________ Θ(n log(n)) ___________ O(n^2)
Shell Sort Ω(n log(n)) ___________ Θ(n(log(n))^2) ___________ O(n(log(n))^2)
Bucket Sort Ω(n+k) ___________ Θ(n+k) ___________ O(n^2)
Radix Sort Ω(nk) ___________ Θ(nk) ___________ O(nk)
Counting Sort Ω(n+k) ___________ Θ(n+k) ___________ O(n+k)
Cubesort Ω(n) ___________Θ(n log(n)) ___________ O(n log(n))