Glossary: Data Structures and Algorithms in C++
Binary search
Finding an item in sorted data by checking the middle and discarding the half that can't hold the target, so n items need about log₂ n steps.
Glossary: Data Structures and Algorithms in C++
Finding an item in sorted data by checking the middle and discarding the half that can't hold the target, so n items need about log₂ n steps.