编辑代码

#include <stdio.h>

bool Binary_Search(int a[],int length ,int k){
	int left = 0;
	int right = length -1;
	int mid; 
	while(left<=right){
		mid = (left+right)/2;
		if(a[mid] == k) {
			return true;
		}
		else if(a[mid]>k) {
			left = mid +1;
		}else{
			right = mid -1;
		}
	}
return false;
}
int main(){
	int a [] = {85, 63, 52, 34, 25, 17, 6};
	int length = sizeof(a)/sizeof(a[0]);
	int search_k = 6;
	bool flat = Binary_Search(a,length,search_k);
	if(flat)
		printf("查找成功元素为\t%d\n",search_k);
	else
	printf("不存在元素 %d\n",search_k);
return 0;
}