Binary Search
Binary search halves a sorted array each step. It is wrong on an unsorted array.
Costs
| Category | Algorithm |
| Difficulty | Easy |
| Time | O(log n) |
| Requires | a sorted random-access array |
| Extra memory, iterative | O(1) |
Questions
What is Binary Search?
Binary search halves a sorted array each step. It is wrong on an unsorted array.
Where do I practice it?
DSA Master keeps challenges and progress on the phone. This page is the idea and the costs.