3.找数组中某个数的下标

F1，常规方法

//F1常规法
#include <stdio.h>
int main()
{
	int k = 0;
	//输入K的值
	scanf_s("%d", &k);
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	//下角标从0开始计算
	int sz = sizeof(arr) / sizeof(arr[0]);
	int i = 0;
	for (i = 0; i < sz; i++)
	{
		if (arr[i] == k)
		{
			printf("%d", i);
		}
		else 
		{
			printf("找不到");
			break;
		}
	}
	return 0;
}

F2:二分法

//F2:二分法
#include <stdio.h>
int main()
{
	int k = 0;
	scanf_s("%d", &k);
	//创建数组
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	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", mid);
			break;
		}
	}
	if (left > right)
	{
		printf("找不到");
	}
	return 0;
}

原理：