← Quiz: Merge Sort and Quick Sort: all 13 questions
Quiz: Merge Sort and Quick Sort · Question 6 of 13
How much extra memory does merge sort on an array need?
How much extra memory does merge sort on an array need?
- A.O(1)
- B.O(log n)
- C.O(n)
- D.O(n²)
Answer & explanation
Correct answer: O(n)
Merging needs a temporary list as big as the part being merged.
Can you get the rest right without peeking?
Take the timed Quiz: Merge Sort and Quick Sort quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →