iterative binary search

by sramnan

JavaScript

var doSearch = function(array, targetValue) {
	var min = 0;
	var max = array.length - 1;
    var guess;
    while(min<=max){
    guess = Math.floor((min + max)/2);
    if(array[guess] === targetValue){
        return guess;
    }
    else if(array[guess] > targetValue){
        max = guess -1;
    }
    else if(array[guess] < targetValue){
        min = guess + 1;
    }
    }


	return -1;
};
console.log(doSearch([3,4,5],5));