【C语言】每日一代码：用函数实现二分查找

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int bin_search(int arr[], int left, int right, int key)
{
	
	int mid = 0;//记录中间元素的下标

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

int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int key = 7;
	printf("要查找的数字为：%d\n", key);
	int left = 0;
	int right = sizeof(arr) / sizeof(arr[0]) - 1;

	int find = bin_search(arr, left, right, key);
	if (find == -1)
		printf("找不到指定数字");
	else
		printf("找到了，下标为%d\n", find);
	
	return 0;
}