二分查找模拟实现

#include


int main()//二分查找
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	int k = 5;
	int left = 0;
	int right = sz - 1;
	int flag = 0;
	while (left<=right)
	{
		int mid = (left + right) / 2;
		if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到了，下标是%d\n",mid);
			flag = 1;
			break;
		}

	}
	if (0 == flag)
	{
		printf("找不到了\n");
	}
	return 0;
}

可复制粘贴，慢慢理解。