12.1.7. Comparative Performance of Sorting Algorithms

Try these first

1. 1.

   What is the first step in the insertion sort algorithm?

   Hint

   Think about how you would position cards when sorting.

2. 2.

   In which scenarios does insertion sort perform best?

   Hint

   Consider how sorting affects the number of comparisons made.

3. 3.

   What is the average time complexity of insertion sort?

   • O(n)
   • O(n log n)
   • O(n²)

   Hint

   Recall the lessons on sorting complexities we've covered.

4. 4.

   True or False: Insertion sort can perform faster than selection sort when data is nearly sorted.

   • True
   • False

   Hint

   Think about how many moves an already sorted array would require.

5. 5.

   Given the array [12, 11, 13, 5, 6], describe the steps taken by insertion sort.

   Hint

   Visualize how each number navigates through the sorted section.

6. 6.

   How will insertion sort behave if the array is initially sorted? Explain your reasoning.

   Hint

   Consider how many comparisons or movements would occur in the best-case scenario.