（C）数组中元素的查找——二分法

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<time.h> 
#define N 10
void main()
{
	int a[N]={3,6,8,9,11,16,19,20,11,30};
	int x,i;
	int top=0,bot=N-1,mid,find=0;
	printf("数组为：");
	for(i=0;i<N;i++)
		printf("%3d",a[i]);
	printf("\n请输入要查找的数：");
	scanf_s("%d",&x);
	do{
	mid=(top+bot)/2;
	if(x==a[mid])  find=1;
	if(x<a[mid]) bot=mid-1;
	if(x>a[mid]) top=mid+1;
	}while(top<=bot&&find==0);
		if(find==1)
			printf("找到了\n");
		else printf("找不到\n");
	system("pause");
}