Binary Search Exercise

Write the Binary Search algorithm!

• Pair up!
• Write pseudocode for this problem! Improve on the steps from the Binary Search: Steps slide. Can you make those steps more 'code-like'?
• Now write the code for this algorithm. You can use repl.it or some other environment to run and test code.
• The function you write should accept as parameters an array and a value you want to find. The function should return the index of the found value.

function binarySearch(array, value) {
  var low = 0;
  var high = array.length - 1;
  var middle;
  
  while (low <= high) {
    middle = (low + high) / 2;
    if (array[middle] > value) {
      high = middle - 1;
    } else if (array[middle] < value) {
      low = middle + 1;
    } else {
      return middle;
    }
  }
}