Binary Search

## How Binary Search Works

Binary Search is an efficient algorithm for finding an element in a sorted array. It works by repeatedly dividing the search interval in half.

### Algorithm Steps:
1. Start with the entire sorted array
2. Compare target with the middle element
3. If target equals middle, we're done
4. If target < middle, search left half
5. If target > middle, search right half
6. Repeat until found or interval is empty

### Key Characteristics:
- **Efficient**: O(log n) time complexity
- **Requires sorted array**: Must sort first if unsorted
- **Divide and conquer**: Halves search space each step