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

程序代码：

#include <stdio.h>
#include <windows.h>
int binary_search(int arr[], int num, int left, int right)
{
	int mid = 0;
	while (left <= right)
	{
		mid = left - (left - right) / 2;
		if (arr[mid]>num)
		{
			right = mid - 1;
		}
		else if (arr[mid] < num)
		{
			left = mid + 1;
		}
		else
		{
			return mid;
		}
	}
	if (left>right)
	{
		return -1;
	}
}
int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	int a = binary_search(arr,7, 5, 8);
	if (a != -1)
	{
		printf("找到了,下标%d\n", a);
	}
	else
	{
		printf("没找到\n");
	}
	system("pause");
	return 0;
}

程序运行结果：