有序数组二分法查找数值

#include <stdio.h>#define M 11/*** 有序数组二分法查找数值* low最小值* mid中间值* high 最大值* val输入值* fount 判断值 1 找到 0 未找到*/void main(){int low, mid, high, val, fount;static int arr[M] = {-12,-4,-1,0,11,22,44,67,89,90,111};printf ();low = 0;high = M – 1;( scanf(, &val) != 1 ) {printf();getchar();}while ( low <= high ){mid = ( low + high ) / 2;if ( val == arr[mid] ) {fount = 1;break;}if ( val < arr[mid] ) {–high;} else {++low;}}if ( fount == 1 ) {printf (, val, mid);} else {printf (, val);}}，网站空间，香港虚拟主机，美国空间看天，看雪，安安静静，不言不语都是好风景。