What is Binary Search?
Look at the middle of a sorted list and throw away the half that cannot contain the target.
Binary Search Visualizer
Look at the middle of a sorted list and throw away the half that cannot contain the target. Interactive step-by-step animation with JavaScript code, complexity and front-end use cases.
Localprivate by defaultFastno sign-up path
Loading animation...
Binary Search Visualization and Animation
Look at the middle of a sorted list and throw away the half that cannot contain the target. Set a low and a high pointer around the sorted list. Compare the middle value with the target. Move low or high past the middle to drop half of the list, and repeat. Time complexity: O(log n). Space complexity: O(1). Searching sorted data, finding positions in virtualized lists and even finding the commit that broke your app (git bisect).
How to use Binary Search Visualizer
- Set a low and a high pointer around the sorted list.
- Compare the middle value with the target.
- Move low or high past the middle to drop half of the list, and repeat.
- Press Play, or step through with the arrow buttons and change the input to see how it reacts.
Questions
What is the time complexity of Binary Search?
Time: O(log n). Space: O(1).
Where do front-end developers use Binary Search?
Searching sorted data, finding positions in virtualized lists and even finding the commit that broke your app (git bisect).
Does this upload my data?
No. This converter runs in your browser for ordinary use, so the input is not sent to a backend by this tool.
Related tools
Keep working without searching again.