二分查找c语言

#include
#define N 20
int Search(int *pa, int n, int k,int *p);
int main()
{
     int a[N],n,cmp,*p=&cmp;
     int pos,num=0;
     int i,k;
     scanf("%d",&n);
     for(i=0;i=0;j--,i++)
    {   if(pa[i]<=k){cunt++;if(pa[i]==k){*p=cunt;return i;}}
        else {cunt++;break;}
        if(pa[j]>=k){cunt++;if(pa[j]==k){*p=cunt;return j;}}
        else {cunt++;break;}
    }
    *p=cunt;
    return -1;
}