折半查找

#include <stdio.h>

void BinarySearch(int a[], int left, int right, int num){
	
	if(left > right){
		printf("查找失败！\n");
		return ;
	}
	
	int mid = (left + right) / 2;
	
	if(a[mid] == num){
		printf("要查找的数字的位置为第%d个。\n",mid + 1);
		return;
	}
	
	if(a[mid] > num)
		BinarySearch(a,left,mid-1,num);
	if(a[mid] < num)
		BinarySearch(a,mid+1,right,num);
}

int main(){
	int a[100],n,num;
	
	scanf("%d",&n);
	
	for(int i = 0; i < n; i ++)
		scanf("%d",&a[i]);
	
	scanf("%d",&num);
	
	BinarySearch(a,0,n-1,num);
	 
	return 0;
}