13.1.4. Recursive Strategy of Merge Sort

Try these first

1. 1.

   What is the first step in the Merge Sort algorithm?

   Hint

   Think about how we divide things.

2. 2.

   What happens when the array is divided down to one element?

   Hint

   What is the definition of a sorted array?

3. 3.

   What is the time complexity of Merge Sort?

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

   Hint

   Consider the efficiency for larger data sizes.

4. 4.

   True or False: Merge Sort is an efficient algorithm for large data sets.

   • True
   • False

   Hint

   Reflect on the characteristics of different sorting algorithms.

5. 5.

   Implement the Merge Sort algorithm in a programming language of your choice and analyze its performance with varying data sizes.

   Hint

   Start by breaking down the components of the algorithm.

6. 6.

   Discuss the potential drawbacks of Merge Sort compared to other sorting algorithms.

   Hint

   Consider both speed and memory in your analysis.