13.3.2. Base Case for Recursive Merge Sort

Try these first

1. 1.

   What is the base case for merge sort?

   Hint

   Think about when you can stop dividing the array.

2. 2.

   What does 'merging' refer to in merge sort?

   Hint

   Consider how you would combine two stacks of sorted cards.

3. 3.

   What is the time complexity of merge sort?

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

   Hint

   Consider how both phases of the algorithm contribute to the overall time.

4. 4.

   True or False: The base case for merge sort occurs when the array has two elements.

   • True
   • False

   Hint

   Think about when no sorting is necessary.

5. 5.

   Implement the merge sort algorithm in a programming language of your choice and explain the output.

   Hint

   Start with the base case, then implement the recursive calls and merging.

6. 6.

   Given a large dataset, describe how you would apply merge sort and optimize its performance.

   Hint

   Think about how data management impacts performance.