Binary Search Algorithm
How it Works
- It finds the middle element of the array and compares it to the key
- If it isn't equal, the half that is either higher or lower than the key is eliminated from the search
- Repeat the previous steps until the key is found or isn't in the array