Insertion sort is especially efficient when the list is:

  1. nearly sorted
  2. stored on paper
  3. in reverse order
  4. very large and random
Answer

A) nearly sorted

Few items need to be shifted when the list is almost sorted. SLO CS-11-B-02

Computer Science MCQ · More Unit 2: Computational Thinking and Algorithms MCQs · Practise