13.2.1. Description of Iterative Merge Process

Try these first

1. 1.

   Explain the main steps involved in the merge process.

   Hint

   Remember how you would compare two sorted lists.

2. 2.

   What are the base conditions for recursion in merge sort?

   Hint

   Think about when dividing an array is pointless.

3. 3.

   What is the best case time complexity of Merge Sort?

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

   Hint

   Think about how often the merging takes place.

4. 4.

   True or False: Merge Sort can sort linked lists as efficiently as arrays.

   • True
   • False

   Hint

   Think of how we handle nodes in linked lists.

5. 5.

   Construct a detailed step-by-step merging process for the arrays [8, 19, 24] and [2, 10, 30].

   Hint

   List out each comparison for clarity.

6. 6.

   Explain why Merge Sort is preferred over simple sorting algorithms for large datasets.

   Hint

   Consider the performance metrics we've discussed.