GATE DA 2025 — Question 29

Programming, Data Structures and Algorithmsbasic sorting algorithms: selection sort, bubble sort and insertion sortMSQ1 markMedium

Suppose that insertion sort is applied to the array [1, 3, 5, 7, 9, 11, \(x\), 15, 13] and it takes exactly two swaps to sort the array. Select all possible values of \(x\).
  1. A
    10
  2. B
    12
  3. C
    14
  4. D
    16
Practise the full 2025 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on basic sorting algorithms: selection sort, bubble sort and insertion sortTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group