1

# Binary Search

2

### Efficient algorithm for finding an item in a sorted list of items . it works by repeatedly dividing in half the partitionof the list that could contain the item , until you,ve narrowed down the possible locations to just one

3

### we basically ignore half of the elements afer just one iteration

4

### i) Compare x with the middle element 

5

### ii) if x matches the middle element, we return the mid index.