Some Important points from wiki -->

https://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list

- If the algorithm always completes after at most
*f*(*n*) steps, it cannot distinguish more than 2^{f(n)}cases because the keys are distinct and each comparison has only two possible outcomes. - Determining the
*exact*number of comparisons needed to sort a given number of entries is a computationally hard problem even for small*n*, and no simple formula for the solution is known.