二分法查找

#define  _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>

int inlue(int arr[],int k,int sz)
{
	int left = 0;
	int rigth = sz - 1;

	while (left <= rigth)
	{
			//eid中间元素下标
		int eid = (left + rigth) / 2;

		if (arr[eid] < k)
		{
			left = eid + 1;
		}
		else if(arr[eid] > k)
		{
			rigth = eid - 1;
		}
		else
		{
			return eid;
		}
	}
	return -1;
}

int main()
{
	int arr[] = {1,2,3,4,5,6,7,8,9,10};
	
	int k = 7;
	int sz = sizeof(arr)/sizeof(arr[0]);

	int ret = inlue(arr, k, sz);

	if (ret == -1)
	{
		printf("找不到指定的数字\n");
	}
	else
	{
		printf("找到了，下标是：%d\n",ret);
	}

	return 0;
}