13.1.1. Introduction to Merge Sort

Try these first

1. 1.

   What is Merge Sort?

   Hint

   Think about the process of sorting, what steps do we take?

2. 2.

   What do we call the condition where the recursion stops in Merge Sort?

   Hint

   What is the smallest size an array can be?

3. 3.

   What is the time complexity of Merge Sort?

   • O(n^2)
   • O(n)
   • O(n log n)

   Hint

   Consider how many times you can divide a dataset before reaching a base case.

4. 4.

   True or False: Merge Sort is an unstable sorting algorithm.

   • True
   • False

   Hint

   Think about the order of equal elements.

5. 5.

   Demonstrate a step-by-step process of Merge Sort on the array [37, 25, 43, 9, 18, 72].

   Hint

   Focus on one level of sorting at a time.

6. 6.

   Why might someone choose to use Merge Sort over Quick Sort in certain scenarios?

   Hint

   Consider the characteristics of data structures.