13.2. Iterative Merge Function

Try these first

1. 1.

   What is the time complexity of the merge operation?

   Hint

   Consider how many elements are in both arrays.

2. 2.

   What happens if one array is exhausted during merging?

   Hint

   Think about what it means to have one array 'empty'.

3. 3.

   What is the main purpose of the iterative merge function?

   • To sort an array
   • To combine two sorted arrays
   • To reverse an array

   Hint

   Think about what merging means in the context of sorted arrays.

4. 4.

   True or False: Merge sort is not suitable for large datasets due to its O(n^2) time complexity.

   • True
   • False

   Hint

   Focus on the complexities of sorting algorithms.

5. 5.

   Write a detailed explanation of how merge sort works, including both the divide and merge steps, and discuss its advantages over other sorting algorithms.

   Hint

   Try outlining the steps methodically.

6. 6.

   Create a visual representation that illustrates both the merge sort process and the iterative merging of two sorted arrays.

   Hint

   Visuals help in understanding how the merging at each level occurs.