Skip to content
Ravnary
A Knowledge Platform
Categories
Learn
Cheatsheets
Paths
Favourites
Review
Community
Colour theme
Light
Dark
System
Learn
Coding Interview Patterns
Sorting, Searching and Priority
Modified Binary Search
Quiz
Q 01
/ 04
Intermediate
Question 1 of 4. 0 correct, 0 incorrect.
A search with low < high sets low = mid when the check passes at mid, and computes mid = low + (high − low) // 2. Once high = low + 1 and the check passes at mid, does the loop end?
Ends
Never ends
Check answer
Home
Learn
Paths
Saved
Community