二分查找算法

#include<stdio.h>
#include<stdlib.h>


int ERFind(int a[],int n,int k)//n为查找数组的最后一位元素的下标，k为关键字，a为需要查找的数组
{
//int i;
	int low,high;
	low=0;
	high=n;
	int mid;
	while(low<=high){
	mid=(low+high)/2;
	if(k==a[mid]){
	return mid;
	}
	else if(k<a[mid])
{
	high=mid-1;
}else{
	 low=mid+1;
	}
}
	return -1;
}


void main(){

int key=35;
int arr[]={1,2,3,4,5,6,7,8,9,12,35};

int c=ERFind(arr,10,key);
printf("%d",c);


}