Binary Search Recursion

by Paco86

JavaScript

function binarySearchRecursion(arr, item){
  if(arr.length === 0){
  	return -1;
  }else{
  	var maxIndex = arr.length - 1;
  	var minIndex = 0;
  	var midIndex = Math.floor((maxIndex + minIndex)/2);
    debugger;
    if(arr[midIndex] === item){
    	return arr[midIndex];
    }else if(arr[midIndex] < item){
    	return binarySearchRecursion(arr.slice(midIndex + 1), item);
    }else{
    	return binarySearchRecursion(arr.slice(0, midIndex), item);
    }
  }
  
}


var arr = [23, 45, 88, 123, 432, 899];
alert(binarySearchRecursion(arr, 432));