Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 20
What does the master theorem give for T(n) = 2T(n/2) + O(1)?
A
O(n log n)
B
O(log n)
C
O(n^2)
D
O(n)