Binary Search Correct

by rishul matta

JavaScript

function binarySearch(A, nos) {
	var min, max, mid;
  min = 0;
  max = A.length -1;
  while (min <= max) {
  	mid = Math.floor((max-min)/2) + min;
    if (A[mid] == nos) {
    	return mid;
    }
    if (A[mid] > nos) {
    	max = mid - 1;
    } else {
    	min = mid + 1;
    }
  }
  
  return -1;

}

console.log(binarySearch([1,2,3,4,5,6,7,8,9], 1))