13.2.2. Implementation of Merge Sort

Try these first

1. 1.

   What is the time complexity of Merge Sort?

   Hint

   Think about how it compares to other sorting algorithms discussed.

2. 2.

   Name the three main steps in the Merge Sort algorithm.

   Hint

   Recall the core principles we discussed.

3. 3.

   What is the best-case time complexity of Merge Sort?

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

   Hint

   Review the performance analysis section.

4. 4.

   True or False: Merge Sort can be applied to linked lists?

   • True
   • False

   Hint

   Think about the nature of linked lists.

5. 5.

   Given the array [34, 7, 23, 32, 5, 62], explain the full process of Merge Sort step-by-step, including the final merged array.

   Hint

   Focus on how many times the array is divided and how merging works for each level.

6. 6.

   Write a full implementation of Merge Sort in any programming language (e.g., Python, Java). Ensure to include edge cases.

   Hint

   Think about how functions can be defined and how recursion is handled.