Skip to content
Related Articles

Related Articles

Algorithms | InsertionSort | Question 3
  • Difficulty Level : Basic
  • Last Updated : 24 Jun, 2016

Which of the following statements is correct with respect to insertion sort ?

*Online - can sort a list at runtime
*Stable - doesn't change the relative 
          order of elements with equal keys. 

(A) Insertion sort is stable, online but not suited well for large number of elements.
(B) Insertion sort is unstable and online
(C) Insertion sort is online and can be applied to more than 100 elements
(D) Insertion sort is stable & online and can be applied to more than 100 elements


Answer: (A)

Explanation: Time taken by algorithm is good for small number of elements, but increases quadratically for large number of elements.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :