First Occurance in a Binary search

by rishul matta

JavaScript

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

}

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