← Back to Algorithms

Binary Search

Search a sorted array by repeatedly dividing the search interval in half.

Normal
Step 0 of 0
Time Complexity: O(log N)
Space Complexity: O(log N)

How it works

How it works: Repeatedly halves the search range to find the target in a sorted array.