给一个序有数组,查找目标值。
#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>//包含头文件才可以用sort
int search(vector<int>&, int value);
int main()
{
vector<int>v = { 1,2,3,4,5,6,7,8,9 };
cout << "value的位置" << search(v, 4) << endl;
return 0;
}
int search(vector<int>&nums, int value)//数组必须是有序才可以用二分查找法
{
int left = 0;
int right = nums.size() - 1;
while (left <= right)
{
int mid = left + (right - left);
if (nums[mid] < value)
{
left = mid + 1;
}
else if(nums[mid]>value)
{
right = mid - 1;
}
else
{
return mid;
}
}
return -1;
}