Alexander Kazanski
Posted on
Binary search cuts your search space in half every step — O(log n) instead of O(n). This template handles every sorted-array problem.
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)