GATE DA 2024 Q45: Sorting algorithm that sorts [4, 3, 2, 1, 5] in two passes
- Programming, Data Structures and Algorithms
- 2 marks
- MCQ
- −2/3 if wrong
Question
Consider the following sorting algorithms:
(i) Bubble sort
(ii) Insertion sort
(iii) Selection sort
Which ONE among the following choices of sorting algorithms sorts the numbers in the array [4, 3, 2, 1, 5] in increasing order after exactly two passes over the array?
Try it: multiple choice: exactly one correct option
Show answer and explanation
Answer: B (official GATE 2024 final answer key)
Concept used: What one pass of each simple sort guarantees.
First step: Selection sort swaps 1 to the front, then 2 into place: [1, 2, 3, 4, 5]. Bubble sort gives [2, 1, 3, 4, 5]; insertion sort gives [2, 3, 4, 1, 5].
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2024 DA question paper and final answer key, organised by IISc Bangalore. Question paper · Answer key
More Programming, Data Structures and Algorithms PYQs
- 2026 · Q15Expected-time recurrence for randomised-input quicksort
- 2026 · Q16Python mutable default argument output
- 2026 · Q25Binary tree from preorder and inorder traversals
- 2026 · Q31Worst-case comparisons in binary search of 1000 elements
- 2026 · Q39Number of calls made by a Fibonacci-like recursion
- 2026 · Q40Reachability in a graph and its reverse