How does binary search work and what are its requirements?
Task
Find the index of an element in a sorted array in O(log n). Bonus: return the position where the element should be inserted if it is absent (lower bound).
The rest of this answer, with code and interview follow-ups, is in the DevPrep app.
Read the full answer in DevPrep