实现一个整形有序数组的二分查找

函数写法 

//写一个函数，实现一个整形有序数组的二分查找。
//找到了，就返回下标
//找不到，返回 -1

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

	while (left<=right)
	{
		//int mid = (left + right) / 2;
		int mid = left + (right - left) / 2;
        //这样写的目的是为了防止(left + right) / 2 溢出而导致结果异常

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

int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int k = 0;
	scanf("%d", &k);//输入的是要查找的值
	//FindNum();
	int sz = sizeof(arr) / sizeof(arr[0]);
	int ret = binary_search(arr, k, sz);
	if (ret == -1)
	{
		printf("找不到\n");
	}
	else
	{
		printf("找到了，下标是：%d\n", ret);
	}
	return 0;
}

非函数写法

#include <stdio.h>
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	//printf("%d\n", sizeof(arr));//40 - 数组的总大小，单位是字节
	//printf("%d\n", sizeof(arr[0]));
	//printf("%d\n", sizeof(arr)/sizeof(arr[0]));//
	int sz = sizeof(arr) / sizeof(arr[0]);

	int k = 0;
	scanf("%d", &k);

	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 (flag == 0)
		printf("找不到\n");

	return 0;
}