Binary Search Iterative

BinarySearchIterative.js

function binarySearchIterative(inputArray, searchTerm) {
  let left = 0;
  let right = inputArray.length - 1;

  while(left <= right) {
    const midPoint = Math.floor((left + right) / 2);

    if (inputArray[midPoint] === searchTerm) {
      return true;
    } else if (searchTerm < inputArray[midPoint]) {
      right = midPoint - 1
    } else {
      left = midPoint + 1;
    }
  }

  return false;
}