递归算法实现二分查找

#include<iostream>
using namespace std;
int jc(int,int);
int num,n,a[1000],m;
int main()
{
int x,y,i;
cin>>n;
x=1;
y=n;
for(i=1;i<=n;++i)
cin>>a[i];
cin>>m;
jc(x,y);
cout<<endl;
}
int jc(int x,int y)
{
int k;
k=(x+y)/2;
if(a[k]==m)
cout<<"in "<<k<<endl;
if(x>y)cout<<"no"<<endl;
else
{
if(a[k]<m) jc(k+1,y);
if(a[k]>m) jc(x,k-1);
}
}