Gate CS-2006 Question Paper With Solutions

Q. 13 The median of n elements can be found in O(n) time. Which one of the following is correct about the complexity of quick sort, in which remains is selected as pivot? Gate CS-2006 Question Paper With Solutions Answer: (B)

Explanation: Gate CS-2006 Question Paper With Solutions

Learn More:   Gate ME 2015-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here