利用选择排序排序数组，用二分查找法查找

#include <stdio.h>
#include <iostream>
using namespace std;

int main()
{
    int a[] ={1,8,45,12,75,466,25,65,14,56,53};
    int t;
    int length;
    length =sizeof(a)/sizeof(a[0]);
    for(int i=0;i<length;i++)
    {
        for(int j=i+1;j<length;j++)
        {
            if(a[i]>a[j])
            {
                t=a[j];
                a[j]=a[i];
                a[i]=t;
            }
        }
    }

    for(int i=0;i<length;i++)
    {
        printf("%d\n",a[i]);
    }
    int low=0,hight =length-1;
    
    int aim ,index,flag=0;
    scanf("%d",&aim);
    while(low<=hight)
    {
        int middle =(low+hight)/2;
        if(a[middle]==aim) 
        {
            flag =1;
            break;
        }
         if(a[middle]<aim)
        {
            low=middle+1;
        }
        else hight=middle-1;
    }

    printf("%d",flag);
    system("pause");

}