在有序数组中查找某一个数

利用二分查找

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main()
{
	printf("输入要查找的值:");
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int k;
	scanf("%d", &k);
	int sz = sizeof(arr) / sizeof(arr[0]);//求出元素个数
	int left = 0;
	int right = sz - 1;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else
		{
			printf("已找到，下标是：%d\n", mid);
			break;
		}
	}
	if (left > right)
	{
		printf("无法找到\n");
	}
	system("pause");
	return 0;
}