Skip to content
Related Articles

Related Articles

Algorithms | Sorting | Question 4

View Discussion
Improve Article
Save Article
  • Last Updated : 28 Jun, 2021

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 lienear time in their typical implementation.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!