Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What does the recurrence T(n) = 2T(n/2) + O(n) solve to?
A
O(n log n)
B
O(log n)
C
O(n)
D
O(n^2)