Insertion sort works by:

  1. Choosing items at random
  2. Splitting the list in halves recursively
  3. Taking each item and inserting it into its correct place among the already-sorted items
  4. Repeatedly swapping neighbouring items through the whole list
Answer

C) Taking each item and inserting it into its correct place among the already-sorted items

Like sorting playing cards in your hand one at a time. SLO CS-11-B-02 · Understanding

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