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
Explanation: Insertion sort is directly proportional to number of inversions present in the list.
Quiz of this Question
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.