23.2. Insertion Sort Example

Try these first

1. 1.

   What is insertion sort?

   Hint

   Think about how the algorithm 'inserts' elements.

2. 2.

   Explain the base case in insertion sort.

   Hint

   Consider what happens with an empty array.

3. 3.

   What is the key principle behind the insertion sort algorithm?

   • Sorting elements in pairs
   • Iterative selection of the next element
   • Building a sorted array incrementally

   Hint

   Think about how elements are placed in order.

4. 4.

   True or False: The base case for insertion sort occurs when the array is empty.

   • True
   • False

   Hint

   Consider what would make an array sorted.

5. 5.

   Develop a recursive function for insertion sort in Python and provide a detailed explanation of how it operates step-by-step.

   Hint

   Break down the process of insertion sort into manageable recursive calls and review how elements are reinserted.

6. 6.

   Explain the efficiency of insertion sort compared to larger sorting algorithms like quicksort and merge sort. Discuss the scenarios where insertion sort might be preferable.

   Hint

   Consider the size of different datasets and how sorting efficiency scales.