折半查找 binary search

/*  * file name: binsearch.c * function: example of binary search * */#include <stdio.h>#include <stdlib.h>int main(){int array[]= {2,5,6,7,8,13,15,17,19,21,23,25,26,27,28,35,41,52,63};int len= sizeof(array)/4;int target,mid;int start = 0;int end = len-1;printf("len=%d\n",len);printf("input a number for search:\n");scanf("%d",&target);printf("target is %d\n",target);do{mid = (start + end)/2;if ( array[mid] == target ){printf("%d =array[%d]\n",target,mid);exit(0);} else if (array[mid] > target){end = mid-1;} else {start = mid+1;}} while (start <= end);printf("cannot find the target!\n");return 0;}