Binary search algorithm
Sorting algorithm
>
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the... Wikipedia
Worst-case complexity: O(log n)
Best complexity: O(1)
Class: Search algorithm
Data structure: Array