$ ./guess_the_language
Problem Solving — fill the blank
Problem Solving — fill the blank · hard · #274
What goes in the blank?
# T(n) = 2T(n/2) + O(n) # solves to O(n ____ n)
Answer:
log
(also accepted: log, log2, lg)
The master theorem gives O(n log n) — the merge sort recurrence.
Play Problem Solving ▸
◂ #273
all Problem Solving — fill the blank questions
#275 ▸