Best Case: O(n)

These are sorting algorithms with a best case performance of Ω(n).


Ω(n) is considered as good as it gets when it comes to comparison sorting algorithms. However, the only way a comparison sorting algorithm can operate at this speed is if the array is already sorted. Algorithms in this category tend to degrade fast.