Binary Search

Easy

Binary Search

Binary search efficiently finds a target value by repeatedly halving the search interval in a sorted array.

SearchBasicsDivide & ConquerO(log n)

An algorithm that quickly finds the position of a target value in a sorted array. It is very fast because it halves the search range each time.

1/11

Let's find 60 in the sorted array. Binary search halves the search range each step.

Easy

Binary Search

Binary search efficiently finds a target value by repeatedly halving the search interval in a sorted array.

SearchBasicsDivide & ConquerO(log n)

An algorithm that quickly finds the position of a target value in a sorted array. It is very fast because it halves the search range each time.

1/11

Let's find 60 in the sorted array. Binary search halves the search range each step.