Skip to content

Glossary: Coding Interviews in Java

Binary search

Also written: Collections.binarySearch

Finding a value, or the first position that works, in sorted data by repeatedly checking the middle and discarding half. It costs O(log n).

Where the book teaches it

Related terms

PatternBig-O