折半查找

#include <stdio.h>
int binary_search(int arr[], int key)
{
	int mid = 0;
    int left = 0;
	int right = 0;
	scanf("%d%d",&left,&right);
	while(left<=right)
	{
		mid = left-(left-right)/2;
		if(arr[mid]>key)
		{
			right = mid-1;
		}
		else if(arr[mid]<key)
		{
			left = mid+1;
		}
		else
		{
			return mid;
		}
	}
	if(left>right)
	{
		return -1;
	}
}

int main()
{
	int arr[] = {1,2,3,4,5,6,7,8,9,10};
	int key = 6;
	int ret = 0;
	printf("请输入左右下标数:\n");
    ret = binary_search(arr, key);
	if(ret != -1)
	{
		printf("找到了，下标是: %d\n",ret);
	}
	else
	{
		printf("没找到\n");
	}
	return 0;
}