以下為javascript實現(xiàn)二分查找（binary search）的四種實現(xiàn)方式，其中第一種為遞歸寫法碾阁，其他三種為迭代寫法。
遞歸寫法(recursive approach)
const binarySearchRecursive = (nums, left, right, target) {
if (right <= left) {
return -1;
}
const mid = left + Math.floor((right - left) / 2);
if (nums[mid] > target) {
return binarySearchRecursive(nums, left, mid - 1, target);
} else if (nums[mid] < target) {
return binarySearchRecursive(nums, mid + 1, right, target);
}
return mid;
};
迭代寫法1：left <= right
const binarySearchIterative1 = (nums, target) => {
let left = 0, right = nums.length - 1;
while (left <= right) {
const mid = left + Math.floor((right - left) / 2);
if (nums[mid] === target) {
return mid;
}
if (nums[mid] > target) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return -1;
};
迭代寫法2： left < right
const binarySearchIterative2 = (nums, target) => {
let left = 0, right = nums.length;
while (left < right) {
const mid = left + Math.floor((right - left) / 2);
if (nums[mid] === target) {
return mid;
}
if (nums[mid] > target) {
right = mid;
} else {
left = mid + 1;
}
}
return -1;
};
