Data structures and algorithms
What does the recurrence T(n) = 4T(n/2)+Θ(n²) solve to?
AppliedMultiple choice
What does the recurrence solve to?
- A, because the combine step already costs
- B
- C, from four subproblems of quadratic cost
- D, as for merge sort
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Of the kind reported at
More data structures and algorithms questions
- You need the 100 largest values from a stream of 10⁹ numbers you cannot store.Foundation · Free solution
- What does the recurrence T(n) = 2T(n/2)+O(n) solve to?Applied · Free solution
- Climbing a staircase, part 3 of 3Advanced · Premium
- How many times does the inner body run in for i in range(1000): for j in range(i): body()?Foundation · Premium
- A hot-path buffer is a dynamic array with O(1) amortised push.Applied · Premium
- A dynamic array starts with capacity 1 and doubles when full, copying all elements.Applied · Premium