Practice Example Of Merging Sorted Lists (13.1.3) - Merge Sort - Design & Analysis of Algorithms

Practise this section

8 questions

Flashcard drill
2 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
2 questions · about 1 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is merge sort?
Show hintHide hint
Think about the concept of splitting and merging.
Question 2.
Describe the base case for merge sort.
Show hintHide hint
Consider how recursion stops.
3Question 3.
What is the time complexity of merge sort?
- O(n)
- O(n log n)
- O(n^2)
Show hintHide hint
Think about how many times we divide the data.
4Question 4.
True or False: Merge sort is faster than insertion sort for any given input size.
- True
- False
Show hintHide hint
Consider their performance characteristics.
Question 5.
Given an array [20, 5, 23, 12, 1, 19, 3], implement merge sort and show step-by-step sorting.
Show hintHide hint
Keep tracking the midpoints during splits.
Question 6.
Compare merge sort and quicksort for sorting a large dataset with duplicates. Which might perform better and why?
Show hintHide hint
Consider how the presence of duplicates affects partitions in quicksort.

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