#include<stdio.h>
int main()
{
    int a[10]={5,2,3,0,96,56,45,25,6,20};
    int i,x,leap,low,high,mid;
    i=0;leap=-1;
    scanf("%d",&x);
    while(leap=-1&&i<=9)
    {
        leap=0;
        i++;
    }
    if(leap==1)
        printf("无");
    if(leap==-1)
    while(low<=high)
    {
        mid=(low+high)/2;
        if(a[mid]==x) break;
        else
            if(a[mid]>x) high=mid-1;
            else low=mid+1;
    }
    printf("%d",x);
}


用折半法查找位置。我都写蒙了  谁帮我看看啊！

我现在已经混乱了  都不懂  

#include<stdio.h>
int main()
{
    int x,mid;
    int a[10];
    /*int a[10]={0,2,3,5,6,20,25,45,56,96};*/
    int low=0,high=9,leap=1,i=0;
    for(i=0;i<=9;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("\n");
    scanf("%d",&x);
    printf("\n");
    while(leap==1&&low<=high)
    {
        mid=(low+high)/2;
        if(x==a[mid])
        {
            leap=0;
        }
        else
            if(x>a[mid])
            {
                low=mid+1;
            }
            else
            {
                high=mid-1;
            }
    }
    if(leap==0)
        printf("这个数为第%d个",mid);
    if(leap==1)
        printf("无此数");
}



我做出来了  你们看看，这次不会给你们弄糊涂了。

怎么排序？？你给做出来吧