Gate CS-2016-2 Question Paper With Solutions

Q. 23 Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?

I.   Quicksort runs in Θ(n2) time
II.  Bubblesort runs in Θ(n2) time
III. Mergesort runs in  Θ(n) time
IV.  Insertion sort runs in  Θ(n) time

(A) I and II only

(B) I and III only

(C) II and IV only

(D) I and IV only

Answer: (D)

Explanation: