GATE Computer Science (CS) 2016 Shift 2 Solved Paper
© examsiri.com
Question : 23 of 65
Marks:
+1,
-0
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
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
Go to Question: