13.1. Merge Sort

Try these first

1. 1.

   What is the time complexity of Merge Sort?

   Hint

   Think about how many times you break down the array.

2. 2.

   How does Merge Sort divide the array?

   Hint

   Remember the divide step in the process.

3. 3.

   What is the primary technique used by Merge Sort?

   • Bubble Sort
   • Divide-and-Conquer
   • Insertion Sort

   Hint

   Think about how you can break problems into smaller parts.

4. 4.

   True or False: Merge Sort can only be applied to arrays of even length.

   • True
   • False

   Hint

   Consider how you would handle odd-sized arrays.

5. 5.

   Given an unsorted array, describe how you would implement Merge Sort step by step. Include considerations for edge cases.

   Hint

   Break it down by each phase—dividing, sorting, and merging.

6. 6.

   Create a real-world scenario that could benefit from using Merge Sort, and justify your choice.

   Hint

   Think about where order and efficiency play important roles.