Suppose that insertion sort is applied to the array [1, 3, 5, 7, 9, 11, , 15, 13] and it takes exactly two swaps to sort the array. Select all possible values of .
- A10
- B12
- C14
- D16
Programming, Data Structures and Algorithmsbasic sorting algorithms: selection sort, bubble sort and insertion sortMSQ1 markMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.