$ ./guess_the_language
Problem Solving — fill the blank
Problem Solving — fill the blank · easy · #41
Fill the function name in the binary-search time complexity.
# Binary search runs in O(____ n) time
Answer:
log
(also accepted: log)
Binary search halves the range each step: O(log n).
Play Problem Solving ▸
◂ #40
all Problem Solving — fill the blank questions
#42 ▸