第九天打卡

#include<iostream>
#define N 10
using namespace std;
int main(){
    int i,a[N]={1,2,3,4,5,6,7,8,9,10},low=0,high=N-1,mid,x=-1,m;
    for(i=0;i<N;i++)
    printf("%d ",a[i]);
    printf("\n");
    scanf("%d",&m);
    while(low<=high)
    {
        mid=(low+high)/2;
        if(m<a[mid])
        high=mid-1;
        else
        if(m>a[mid])
        low=mid+1;
        else
        {
        x=mid;
        break;
        }
    }
    if(x>=0)
    printf("x=%d,index=%d\n",m,x);
    else
    printf("Not be found!\n");
    return 0;
}