14.1.6. Exercises on Merge

Try these first

1. 1.

   Explain the merge operation in your own words.

   Hint

   Think about how you compare items to keep them ordered.

2. 2.

   What is the time complexity of the merge operation?

   Hint

   Remember how many comparisons are made.

3. 3.

   What is the primary purpose of the merge operation in merge sort?

   • To compare two lists
   • To combine two sorted lists into one
   • To sort a list

   Hint

   Recall what merging specifically accomplishes in sorting.

4. 4.

   True or False: Merge sort requires additional space to hold the merged elements.

   • True
   • False

   Hint

   Consider how the merging process works.

5. 5.

   Imagine you are tasked to implement a merge function that does not create a new array. Describe your approach, including possible challenges and outcomes.

   Hint

   Consider the implications of 'in-place' operations and how they affect time complexity.

6. 6.

   Devise an algorithm that performs both the intersection and the difference of two sorted lists. Provide the pseudocode for each operation.

   Hint

   Think about how the conditions change depending on the results desired: intersection versus difference.