Binary Search in Javascript

iterative.js

function binarySearch(array, target) {
    var min = 0;
    var max = array.length-1;
    var guess;

    while(max >= min) {
        guess = Math.floor((max + min)/2);
        if(array[guess] === target) {
            return target;
        } else if (array[guess] < target) {
            min = guess + 1;
        } else {
            max = guess - 1;
        }
    }
    return -1 //solution not found.
};