paulobuchsbaum

function binarySearch(key, arr, order, exact, func) {
    var low = 0;
    var high = arr.length - 1;
    var ind, elem;
	if (arr.constructor !== Array) 	
		return (-2)  // Error
	var norm = (! order || (order>=0) );  // ascending order if 0,null,...,positive
    
    while (low <= high) {
        ind = Math.floor( (low + high) / 2);