PA of Algorithms Q37

0. The tightest lower bound on the number of comparisons, in the worst case, for comparison based sorting is of the order of

Answer
Comment
Array

Option : C
Explanation :
The best complexity in worst case for any comparision based sorting technical cannot be less then nlogn.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.