GATE Programming, Data Structures and Algorithms: Divide and conquer: mergesort and quicksort – Previous Year Questions
2 GATE previous year questions on Divide and conquer: mergesort and quicksort (Programming, Data Structures and Algorithms, Data Science and Artificial Intelligence) with answers and explanations, from every paper.
2 questions worth 2 marks in all (2 1-mark). Asked between 2024 and 2026, so you can see how the topic has been tested over time.
- GATE 2024 DA Q30 – Consider sorting the following array of integers in ascending order using an in-place Quicksort algorithm that uses the last element as the pivot. 60…
- GATE 2026 DA Q15 – Consider that the quick sort algorithm is used to sort an array of n distinct randomly ordered elements. In every call, the pivot is chosen as the…