Practice Combining Sorted Lists (13.1.2) - 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 the purpose of merging in the merge sort algorithm?
Show hintHide hint
Think about how you would sort two stacks of cards.
Question 2.
State the base case for the merge sort algorithm.
Show hintHide hint
Consider when no sorting is needed.
3Question 3.
What is the time complexity of merge sort?
- O(n^2)
- O(n log n)
- O(n)
Show hintHide hint
Think about how many splits and merges occur.
4Question 4.
True or False: Merge sort is unstable, meaning it does not preserve the input order of equal elements.
- True
- False
Show hintHide hint
Consider examples with duplicate elements.
Question 5.
Given two sorted arrays A = [1, 3, 5] and B = [2, 4, 6], write a function to merge them without using additional arrays.
Show hintHide hint
Think about how to use indexes of each array to insert elements directly.
Question 6.
Create a visual representation of the merge sort algorithm applied to the array [12, 11, 13, 5, 6, 7]. Describe the merge steps as you go.
Show hintHide hint
Document each comparison during the merging process to illustrate the order.

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