Skip to main content

Sort Algorithms

Time Complexities of Sorting Algorithms

AlgorithmBestAverageWorst
Quick SortΩ(n log(n))Θ(n log(n))O(n^2)
Bubble SortΩ(n)Θ(n^2)O(n^2)
Merge SortΩ(n log(n))Θ(n log(n))O(n log(n))
Insertion SortΩ(n)Θ(n^2)O(n^2)
Selection SortΩ(n^2)Θ(n^2)O(n^2)
Heap SortΩ(n log(n))Θ(n log(n))O(n log(n))
Radix SortΩ(nk)Θ(nk)O(nk)
Bucket SortΩ(n+k)Θ(n+k)O(n^2)