写代码可以在整型有序数组中查找想要的数字，找到了返回下标，找不到返回-1.（折半查找）

#include<stdio.h>
int search(int arr[], int m, int left, int light)
{
	while (left <= light)
	{
		int mid = left + (light - left) / 2;

		if (arr[mid] > m)
		{
			light = mid - 1;
		}
		if (arr[mid] < m)
		{
			left = mid + 1;
		}
		if (arr[mid] == m)
		{
			return mid;
		}	
	}
	return -1;
}

int main()
{
	int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 };
	int m = 0;
	printf("请输入要找的数:>");
	scanf("%d", &m);
	int ret = search(arr, m, 0, 9);
	if (ret == -1)
	{
		printf("找不到\n");
	}
	else
	{
		printf("找到了：%d\n", ret);
	}
	system("pause");
}