算法实验报告
实验一 用分治法实现元素选择
实验代码:
#include
using namespace std;
int main()
{
int a[100],n,x;
int BinarySearch(int a[],const int&x,int n);
cout<
cin>>n;
cout<
for(int i=0;i
{
cin>>a[i];
}
cout<
cin>>x;
if(BinarySearch(a,x,n)!=-1)
cout<
cout<
return 0;
}
int BinarySearch(int a[],const int &x,int n)
{
int left=0,right=n-1;
while(left<=right)
{
int middle=(left+right)/2;
if(x==a[middle])
return middle;
if(x>a[middle])
left=middle+1;
else
right=middle-1;
}
return -1;
}