折半查找

（1）直接编写程序
#include <stdio.h>
#pragma warning (disable:4996)
#include <windows.h>
int main()
{
	int arr[10] = {1,2,3,4,5,6,7,8,9,10 };
	int left = 0;
	int right = (sizeof(arr) / sizeof(arr[0])) - 1;
	
	int num = 0;
	scanf("%d", &num);
	while (left <= right)
	{
		int mid = left - (left - right) / 2;
		if (arr[mid] < num)
		{
			left = mid + 1;
		}
		else if (arr[mid] > num)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到了，%d\n",mid);
			break;
		}
	}
	if (left > right)
	{
		printf("没有这个数\n");
	}
	system("pause");
	return 0;
}
（2）写函数
#include <stdio.h>
#include <windows.h>
int binary_search(int arr[], int num,int sz)
{
	int left = 0;
	int right = sz;
	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 num = 10;
	int sz = (sizeof(arr) / sizeof(arr[0])) - 1 ;
	int a = binary_search(arr, num, sz);
	if (a != -1)
	{
		printf("找到了,下标%d\n",a);
	}
	else
	{
		printf("没找到\n");
	}
	system("pause");
	return 0;
}
（3）函数在优化，可以确定查找的范围
#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;
}