Binary Search
- Binary Search is a searching algorithm used to find an element's position in a sorted array.
- The search can be performed iteratively or recursively.
- Essentially, binary search defines a high and a low pointer that work together to "single out" the target value.
