Gate CS-2004 Question Paper With Solutions

Q. 3 The tightest lower bound on the number of comparisons, in the worst case, for

comparision-based sorting is of the order of

(A) n

(B) n2

(C) n log n

(D) n log2 n

Answer: (C)

Explanation:

Gate CS-2004 Question Paper With Solutions

Learn More:   Gate CS-2015-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here