Practice Conclusion And Future Directions (14.1.8)

Practise this section

10 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is the time complexity of merge sort?
Show hintHide hint
Think about how it compares to O(n²).
Question 2.
What is one limitation of merge sort?
Show hintHide hint
Consider how merging two lists works.
3Question 3.
What is the time complexity of merge sort?
- O(n)
- O(n²)
- O(n log n)
Show hintHide hint
Compare with other sorting algorithms' complexities.
4Question 4.
Merge sort is an in-place sorting algorithm. True or False?
- True
- False
Show hintHide hint
Think about how merge sort handles lists during operations.
Question 5.
Design an iterative version of merge sort that minimizes space usage.
Show hintHide hint
Think about how you can work with elements without needing an entirely new list.
Question 6.
Implement a function that performs set intersection using merge sort's merge process.
Show hintHide hint
Consider how to handle duplicates while merging.

6 more questions in this section. Enroll free to practise them all.