Binary search is a method for locating an element in a sorted list efficiently. Searching for an element can be done naively in O(N) time, but binary search speeds it up to O(log N) in the worst case.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback