#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
#define SortNum 10
bool Fun(vector<int> &vectNum, int nFindNum)
{
int nL = 0;
int nR = vectNum.size() - 1;
while (nL <= nR)
{
int nMid = (nL + nR) / 2;
if (nFindNum == vectNum[nMid])
{
return true;
}
else if (nFindNum > vectNum[nMid])
{
nL = nMid + 1;
}
else
{
nR = nMid - 1;
}
}
return false;
}
void FunTest(vector<int> &vectNum, int nFindNum)
{
if (Fun(vectNum, nFindNum))
{
cout << nFindNum << "存在数组中" << endl;
}
else
{
cout << nFindNum << "不存在数组中" << endl;
}
}
int main()
{
vector<int> vectNum;
for (int i = 1; i <= SortNum; i++)
{
vectNum.push_back(rand()%1000);
}
sort(vectNum.begin(), vectNum.end());
for (int nNum = 0; nNum < vectNum.size(); nNum++)
{
cout << vectNum[nNum] << " ";
}
cout << endl << endl;
FunTest(vectNum, vectNum[0]);
FunTest(vectNum, vectNum[1]);
FunTest(vectNum, vectNum[2]);
FunTest(vectNum, vectNum[8]);
FunTest(vectNum, vectNum[9]);
FunTest(vectNum, 1001);
FunTest(vectNum, -1);
return 0;
}