Question $24$

The tightest lower bound on the number of comparisons, in the worst case, for comparisonbased sorting is of the order of

Your answer:

$n$

$n^2$

$n(logn{)}^2$

nlogn

Clear answer