26.c

折半查找算法的实现

int a,mark=0;
int num[10]={2,11,16,26,39,43,56,68,77,82};

void search(int low,int high){
    if(low<=high){
        int mid=(low+high)/2;
        if(num[mid]==a) {mark=1;printf("你找到的数在第 %d 个\n",mid+1);}
        else if
	    (num[mid]>a)
	{search(low,mid-1);}
    else
	{search(mid+1,high);}
    }
}

main(){
    printf("请输入你要找的数字：");
    scanf("%d",&a);
    search(0,11);
    if(mark==1)
	{printf("找到该数!\n");}
    else{
	printf("未找找该数!\n");}
}