Binary Search

by XcsN

JavaScript

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

var orderedPrimes = [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];

console.log("Found prime at index " + doSearch(primes, 11));