二分发查找

#include <stdio.h>

void main()
{
        int high = 9,low = 0,m,k,a[10]={1,2,3,4,5,6,7,8,9,10};//hing和low赋初值

        scanf("%d",&k);

        while (high>=low){
                m=(high+low)/2;

                if(k<a[m])
                        high=m-1;//比较的是数值而不是下标
                else if(k>a[m])
                        low=m+1;
                else{
                        printf("yes\n");
                        printf("m = %d\n", );
                        return;//这两句地方放错了
                }
        }

        printf("no\n");
        return;//if语句去掉      
}