Practice Introduction To Merge Sort (13.1.1) - Merge Sort - Design & Analysis of Algorithms

Practise this section

9 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
3 questions · about 2 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 process of sorting, what steps do we take?
Question 2.
What do we call the condition where the recursion stops in Merge Sort?
Show hintHide hint
What is the smallest size an array can be?
3Question 3.
What is the time complexity of Merge Sort?
- O(n^2)
- O(n)
- O(n log n)
Show hintHide hint
Consider how many times you can divide a dataset before reaching a base case.
4Question 4.
True or False: Merge Sort is an unstable sorting algorithm.
- True
- False
Show hintHide hint
Think about the order of equal elements.
Question 5.
Demonstrate a step-by-step process of Merge Sort on the array [37, 25, 43, 9, 18, 72].
Show hintHide hint
Focus on one level of sorting at a time.
Question 6.
Why might someone choose to use Merge Sort over Quick Sort in certain scenarios?
Show hintHide hint
Consider the characteristics of data structures.

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