二分查找

#include<stdio.h>


int search(int key,int array[],int len){
  int ret=-1;
  int left=0;
  int right=len-1;
  
  while(right>left)
  {
	    int mid=(left+right)/2;
	  	if(key==array[mid]){
	  		ret= mid;
	  		break;
		  }
		else if(array[mid]>key){
			right=mid-1;
		}
		else{
			left=mid+1;
		}	
  }
  
  return ret;
}




int main(){
	int account[]={1,6,9,12,15,20,25,36,45,65};
	int k;
	scanf("%d",&k);
	int r=search(k,account,sizeof(account)/sizeof(account[0]));
	if(r==-1){
		printf("没有找到呜呜呜");
	}
	else{
		printf("%d",r);
	}
	return 0;
}