作业8：函数的练习

二分查找

int bin_search(int arr[], int left, int right, int key)
{
	int mid = 0;
	while (left <= right)
	{
		mid = left + ((left - right) >> 1);//防止越界，右移相当于/2
		if (arr[mid] < key)
		{
			left = mid + 1;
		}
		else if (arr[mid] == key)
		{
			return mid;
		}
		else
		{
			right = mid - 1;
		}
	}
}