第一种二分查找:被查找的数组左右边界都为闭区间,即 [left,right] ,此时循环条件要用while(left <= right),代码如下:
int search(int* nums, int numsSize, int target)
{
int left,right;
left = 0;
right = numsSize - 1;
while(left <= right)
{
int mid = (left + right)/2;
if(nums[mid] > target)
{
right = mid - 1;
}
else if(nums[mid] < target)
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}
第二种二分查找: 被查找的数组是一个左闭右开的区间,也就是 [left, right) ,此时循环条件为 while(left < right),代码如下:
int search(int* nums, int numsSize, int target)
{
int left,right;
left = 0;
right = numsSize - 1;
while(left < right)
{
int mid = (left + right)/2;
if(nums[mid] > target)
{
right = mid - 1;
}
else if(nums[mid] < target)
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}