Multiple choice

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

  1. n

  2. n2

  3. nlog n

  4. nlog2n
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Sorting worst case occurs when arrays are reverse sorted, we need to select every element once & for every element min no. of comparison might be log2n. So overall min. complexity 0(nlog n)

Keep practicing — related questions