折半查找法

//数组-折半查找法
#include"stdio.h"
#define N 10
int main(void)
{
    int a[N],i,j,low,high,mid,num,temp,found;
    char choice;
    printf("Please enter %d integers:",N);
    for(i=0;i<N;i++)
        scanf("%d",&a[i]);
    //输入N个整数
    for(j=1;j<N;j++)
        for(i=0;i<N-j;i++)
            if(a[i]>a[i+1])
            {
                temp=a[i+1];
                a[i+1]=a[i];
                a[i]=temp;
            }
    printf("The sorted data is:");
    for(i=0;i<N;i++)
        printf(" %d",a[i]);
    printf("\n");
    //利用冒泡法进行排序并输出
    while(1)/*死循环,不输入"N/n"不结束*/
    {
        printf("Please enter a number to look for:");
        scanf("%d",&num);
        getchar();
        low=0;
        high=N-1;
        found=0;
        /*每次都初始化一次*/
        while(low<=high)
        {
            mid=(low+high)/2;
            if(num==a[mid])
            {
                found=1;
             break;
            }
            else if(num>a[mid]) low=mid+1;
            else high=mid-1;
        }
    if(found==1)
        printf("Has found %d,its position is:%d\n",num,mid+1);
    else
        printf("There is not %d in the data\n",num);
    printf("Continue or Not(Y/N)");
    choice=getchar();
    if(choice=='N'||choice=='n')
        break;
    }
        return 0;
}