在一个有序数组中查找具体的某数字n

第一种方法（遍历）

#include<stdio.h>
int main()
{
	int arr[10] = { 1,2,3,4,5,6,7,8,9,10 };
	int k = 0;
	scanf("%d", &k);
	int i = 0;
	int f = 0;
	for (i = 0;i < 10;i++)
	{
		if (arr[i] == k)
		{
			printf("找到了，下标是%d", i);
			f = 1;
			break;	
		}
	}
	if (f == 0)
		printf("找不到");
	return 0;
}

第二种方法（二分查找） 

int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int i = 0;
	int k = 0;
	scanf("%d", &k);
	int left = 0;
	int right = sizeof(arr) / sizeof(arr[0]) - 1; //标记一下
	int mid = 0;
	
	int flag = 0;
	while (left <= right)
	{
		mid = (right + left) / 2;
		if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到啦 下标是：%d", mid);
			flag = 1;
			break;
		}
	}
	if (flag == 0)
		printf("没有");
	return 0;
}