이진탐색 알고리즘

binarysearch.js

function binarysearch(arr, left, right, x){
  let mid = 0;
  
  if(left > right) { 
    return -1; 
    
  }
  
  mid = (left+right)/2;
  
  if(x === arr[mid]) { 
    return mid; 
    
  } else if (x < arr[mid]) { 
    binarysearch(arr,left,right,x); 
    
  } else { 
    binarysearch(arr,left,right,x);
    
  }
}