求教 各路大神路过进来看看

#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;
int partion(int a[],int p,int r){
srand((unsigned)time( NULL));
int e=rand()%(r-p+1)+p;
int tem;
tem=a[e];
a[e]=a[r];
a[r]=tem;
int x=a[r], i=p-1;
for (int j=p;j<r;j++){
if (a[j]<=x){
tem=a[i+1];
a[i+1]=a[j];
a[j]=tem;
i++;
}
}
tem=a[r];
a[r]=a[i+1];
a[i+1]=tem;
return i+1;
}
int Binsch(int A[],int low,int high,int key)
{
if(low<high)
{
int mid=(low+high)/2;
if(key==A[mid])
return mid;
else if(key<A[mid])
return Binsch(A,low,mid-1,key);
else
return Binsch(A,mid+1,high,key);
}
else return -1;
}
void QuickSort(int a[],int p,int r){
if (p<r){
int q=partion(a,p,r);
QuickSort(a,p,q-1);
QuickSort(a,q+1,r);
}
}
int main(int i,int array[],int yes,int Key){
cout<<"随机十个数:";
for(i=0;i<10;i++)
cin>>array[i];
QuickSort(array,0,9);
cout<<"排序后的数组:";
for(i=0;i<=9;i++)
cout<<array[i]<<" ";
printf("\n 查找数请按--------------1\n");
printf("\n 退出查找请按——————0\n\n");
printf("要查找元素吗？是（按1）否（按0）\n");
scanf("%d",&yes);
while(yes==1)
{
int z=1;
cout<<"输入要查找的数: ";
cin>>z;
int x=Binsch(array,0,9,z);
cout<<"查找的位置在: ";
cout<<x+1<<" ";
printf("\n要继续查找吗？是（按1）否（按0）\n");
scanf("%d",&yes);
}
}