折半查找法

#include <stdio.h>
int main()
{
	int arr[]={1,2,4,5,8,9,14,16,18,24};
	int k;
	printf("请输入要查找的关键字:");
	scanf("%d",&k);
	int left=0;
	int sz=sizeof(arr)/sizeof(arr[0]);
	int right=sz-1;
	while(left<=right)
	{
		int mid=(left+right)/2;
		if(k<arr[mid])
		{
			right=mid-1;
		}
		else if(k>arr[mid])
		{
			left=mid+1;
		}
		else
		{
		printf("找到了,位置是%d\n",mid);
		break;
		}	
	}
	if(left>right)
	{
		printf("找不到"); 	
	}
	return 0;	
}