c语言之二分法搜索

#include<stdio.h>
int search(int x,int a[],int len)
{
int left=0,right=len-1,ret,mid;
int i,j,temp;
for(j=0;j<10;j++)
for(i=0;i<10-1-j;i++)
{
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
}
while(right>=left)
{
mid=(right+left)/2;
if(a[mid]==x)
{
ret=mid;
break;
}
else if(a[mid]>x)
right=mid-1;
else
left=mid+1;
}
return ret+1;
}
int main()
{
int a[10],i;
for(i=0;i<10;i++)
scanf("%d",&a[i]);
printf("%d",search(5,a,10));
}