Open In App

GATE | GATE 2017 MOCK II | Question 12

Like Article
Like
Save
Share
Report

Consider a sorted array of n elements. Let k inversions (swapping) have been performed on the sorted array and we want to sort it again to reverse effect of inversions. If K is very small in comparison to n, then which sorting technique will prove efficient for making again the list in sorted increasing order array.

(A) Selection Sort
(B) Insertion Sort
(C) Bubble Sort
(D) Quick Sort


Answer: (B)

Explanation: Insertion sort is directly proportional to number of inversions present in the list.


Quiz of this Question


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads