Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced).
(A)
Quick Sort
(B)
Heap Sort
(C)
Merge Sort
(D)
Insertion Sort
Answer: (D)
Explanation:
Insertion sort takes linear time when input array is sorted or almost sorted (maximum 1 or 2 elements are misplaced). All other sorting algorithms mentioned above will take more than linear time in their typical implementation.
Quiz of this Question
Please comment below if you find anything wrong in the above post