二分法查找

#include<iostream>

using namespace std;

int BrinarySearch(int A[],int x,int n)

{

int min=0,max=n-1;

while(min<=max)

{

int mid=(min+max)/2;

if(A[mid]==x)return mid;

else if(A[mid]>x)max=mid-1;

else min=mid+1;

}

return -1;

}

 

int main()

{

int n;

cin>>n;

int A[1000];

for(int i=0;i<n;i++)

{

cin>>A[i];

}

int x;

cin>>x;

int num=BrinarySearch(A,x,n);

count<<num+1;

return 0;

}