Correct answer: (D) $\Theta(n^2)$, $\Theta(n \log n)$, and $\Theta(n^2)$
Explanation
Insertion sort takes $\Theta(n^2)$ on a reverse-sorted input. Merge sort always takes $\Theta(n \log n)$. Quick sort takes $\Theta(n^2)$ when the pivot is always the smallest or largest element.
More Searching, Sorting and Hashing questions
GATE 2017 CS (CS1) Q58– Let A be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of…
GATE 2014 CS (CS1) Q24– Quicksort P sorts ascending using the first element as pivot. Let t₁ and t₂ count its…
GATE 2014 CS (CS1) Q49– Find the minimum comparisons needed to find both minimum and maximum of 100 numbers.
GATE 2014 CS (CS3) Q24– Quicksort on n array elements always chooses the central array element as pivot. Find the…
GATE 2014 CS (CS3) Q52– listA contains n > 0 elements sorted in ascending order. Which statement about…
GATE 2016 CS (CS2) Q23– Algorithms sort in ascending order. On an already ascending input, which are true? I:…