Skip to main content
Programmers
OS
Courses
Tutorials
Practice
Jobs
More
Sign In
interactive
•
complete sequence
0s
+15 XP
Binary Search Iteration Sequence
What is the missing step in the standard Binary Search loop?
A
If target < nums[mid], set right = mid - 1; else set left = mid + 1
B
Sort the array again
C
Double the search space
D
Swap left and right pointers
Get Hint (1/1) [-2 XP]
Exit to Challenges
Submit Answer
