binary-search.js

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

var primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 
  41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];

var result = doSearch(primes, 73);
println("Found prime at index " + result);

Program.assertEqual(doSearch(primes, 73), 20);