二分查找 // 非递归算法 function binary_search(arr, key) { var low = 0, high = arr.length – 1; while(low <= high){ var mid = parseInt((high + low) / 2); if(key == arr[mid]){ return mid; }else if(key > arr…