JavaScript实现二分法查找?

JavaScript实现二分法查找

二分法查找要求线性表必须采用顺序存储结构，而且表中元素按关键字有序排列。 有两种方法实现:
一:递归法

var arr = [1, 5, 7, 10, 18, 45, 50, 55, 75, 400];
        function binary_search(find, arr, low, high) {
            if (low <= high) {
                if (arr[low] == find) {
                    return low;
                }
                if (arr[high] == find) {
                    return high;
                }
                var mid = Math.ceil((low + high) / 2);
                if (arr[mid] == find) {
                    return mid;
                } else if (arr[mid] > find) {
                    return binart_search(find, arr, low, mid - 1);
                } else {
                    return binart_search(find, arr, mid + 1, high);
                }
            }
            return -1;
        }
        console.log(binary_search(55, arr, 0, arr.length - 1));//7

二:非递归法

function binary_search(arr, find) {
            var low = 0;
            var high = arr.length - 1;
            while (low <= high) {
                var mid = parseInt((low + high) / 2);
                if (find == arr[mid]) {
                    return mid;
                } else if (find > arr[mid]) {
                    low = mid + 1;
                } else if (find < arr[mid]) {
                    high = mid - 1;
                } else {
                    return false;
                }
            }
        }
        var arr = [1, 5, 7, 10, 18, 45, 50, 55, 75, 400];
        console.log(binary_search(arr, 50));//6

两种方法实现二分法查找,在数据量大的时候推荐非递归法,普通数据用递归法.