14.1.8. Conclusion and Future Directions

Try these first

1. 1.

   What is the time complexity of merge sort?

   Hint

   Think about how it compares to O(n²).

2. 2.

   What is one limitation of merge sort?

   Hint

   Consider how merging two lists works.

3. 3.

   What is the time complexity of merge sort?

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

   Hint

   Compare with other sorting algorithms' complexities.

4. 4.

   Merge sort is an in-place sorting algorithm. True or False?

   • True
   • False

   Hint

   Think about how merge sort handles lists during operations.

5. 5.

   Design an iterative version of merge sort that minimizes space usage.

   Hint

   Think about how you can work with elements without needing an entirely new list.

6. 6.

   Implement a function that performs set intersection using merge sort's merge process.

   Hint

   Consider how to handle duplicates while merging.