# This website is about the Binary Search Algorithm

## There are three sections in this page; 1. How BSA works 2. Imagery of how BSA works 3. Link to a more in depth explanation

__ First section: __

###
The Binary Search Algorithm is used to look for the index of an element in an array and works by:
- Comparing x with the middle element of the array(x is the number we're searching for)
- If x matches the middle element then return the middle index
- Else, if x is greater than the middle element then x must be in the right half of the array, so we recursively go to the middle of the right half
- Else, we recursively got to the left half of the array which means x was smaller than the middle element of the array
- We continously do this until the number is found (or not)

__ Second section: __

__ Third secton: __