编辑代码

#include <stdio.h>
#define M 8

int main() {
   		//二分法查找
int a[M];
int i,flag, mid, low, max, x;
low = 0;
max = M-1;
mid = (low + max) / 2;
printf("请输入%d个数组元素(有序):", M);
for(i=0;i<M;i++)
scanf("%d", &a[i]);
printf("输入要查找的元素:");
scanf("%d", &x);
if (x<a[low] || x>a[max]) {
	printf("超出范围");
}
else{
	while (low <= max) {
		if (a[mid] >x) {
			max = mid - 1;
		}
		else if (a[mid] < x) {
			low = mid + 1;

		}
		mid = (low + max) / 2;
		if(a[mid]==x){

			printf("%d在%d处",x,mid);
			break;
		}

	}
}
    return 0;
}