- If we have an array that is in ascending or descending order, we can use a binary search.
- We pick the mid-point of the array.
- If we have found our search term, our work is done.

- If the search term is not there, we split the array in two segments.
- If our search term is higher than our current term, binary search the top half.
- If our search term is lower than our current term, binary search the bottom half.

- Continue until found, or until the term is not found.

- We pick the mid-point of the array.

The pseudo code of Binary Search is given below:

The Java source code of Binary Search is given below: