Binary Search is defined as a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. Using Iterative approach, we use a while loop to continue the process of comparing the key and splitting the search space in two halves.