13.3.1. Algorithm to Sort Using Merge Sort

Try these first

1. 1.

   What is the time complexity of merge sort?

   Hint

   Think about how the algorithm divides the problem.

2. 2.

   What is the base case in a recursive function for merge sort?

   Hint

   Consider the smallest size of an array that needs no sorting.

3. 3.

   What does merge sort divide an array into?

   • Sorted arrays
   • Single elements
   • Two halves

   Hint

   Think about the first step in the algorithm.

4. 4.

   True or False: Merge sort is faster than insertion sort because it has better time complexity.

   • True
   • False

   Hint

   Compare their efficiency at handling large arrays.

5. 5.

   Given an unsorted array, describe how merge sort would process it step by step.

   Hint

   Think in terms of how the array is broken down until you reach single elements.

6. 6.

   Implement merge sort in your favorite programming language. Analyze its performance on a large dataset.

   Hint

   Focus on demonstrating the efficiency gains provided by merge sort.