>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
What is the iteration count when a positive search range is halved until only one candidate remains? | SWE Maxx
← Question bank
Algorithms · Multiple Choice
Difficulty: Easy
What is the iteration count when a positive search range is halved until only one candidate remains?
Complexity reasoning
Asymptotic analysis
Choose your answer
A
O(n)
B
O(log n)
C
O(n²)
D
O(n log n)
Check answer
More in Algorithms →