Simple Recursive Binary Search Java Script

task3.js

function binarySearch(Array,startIndex, endIndex, x){
  middleIndex= Math.floor((startIndex + endIndex)/2);
  if(startIndex > endIndex)
    return -1;
  if (x == Array[middleIndex])
    return middleIndex;
  else if (x < Array[middleIndex])
    return binarySearch(Array, startIndex, middleIndex -1, x);
  else
    return binarySearch(Array, middleIndex + 1, endIndex, x);
}
if (result == -1){
  console.log("it is not in here!");
}
else{
  console.log("The index of element:" + result);
}
 //You can see it here: https://codepen.io/NargesAsadnajafi/pen/qzKqEP?editors=0012