Binary Search Algorithm

binary search algorithm is used to split the array by divide into two

by DineshAngappa

JavaScript

function binarySearch(arr,l,r,x){
	if(r>=l){
    
  	var m = Math.floor(l + (r - l)/2);
    if(arr[m] ===x){
    	return m;
    }
    
    else if(arr[m] > x)
    	return binarySearch(arr,l,m-1,x);
      
    else if(arr[m] < x)
    	return binarySearch(arr,m+1,r,x);
    
  }else{
  	return false;
  }
}

let arr = [1,5,10,25,30,40,88,100];

console.log(binarySearch(arr,0,arr.length,10));