Practice Analysis Of Merge Sort Complexity (13.4.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 does merge sort do?
Show hintHide hint
Think about how it handles subarrays.
Question 2.
Can merge sort handle arrays of odd size?
Show hintHide hint
What happens when you divide an odd number?
3Question 3.
What is the time complexity of merge sort?
- O(n²)
- O(n log n)
- O(n)
Show hintHide hint
Consider how the array is divided and merged.
4Question 4.
True or False: Merge sort can sort an array of any size effectively.
- True
- False
Show hintHide hint
What happens when sizes are not examples of powers of two?
Question 5.
Given an array of numbers, implement the merge sort algorithm in code. Analyze the time taken for sorting an array of large size.
Show hintHide hint
Pay attention to the merging step and ensure the recursion captures both halves correctly.
Question 6.
Compare and analyze the performance of merge sort and insertion sort on an array of 1000 random integers. Present your findings.
Show hintHide hint
Consider the arrangement of elements as they are sorted.

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