javascript binary search

binary-search.js

function binary_search(arr, search_term, min, max) {
    if (max < min) return -1;
    var i = Math.floor((min + max) / 2),
        curr_term = arr[i];
    if (curr_term === search_term) {
        return i;
    } else if (curr_term < search_term) {
        return binary_search(arr, search_term, min, i - 1);
    } else if (curr_term > search_term) {
        return binary_search(arr, search_term, i + 1, max);
    } else {
        throw new Error("Problem comparing " + search_term + " to " + curr_term);
    }
}​