查找有序数组内的元素（C）

一：强力寻找

#include <stdio.h>
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9 };
	int len = sizeof(arr) / sizeof(arr[0]);
	int i;
	int such = 10;
	for (i = 0; i <= len;  i++)
	{
		if (arr [i] == such)
		{
			printf("序列为：%d\n", i);
			goto out;
		}
	}
	printf("无此序列");
	out:;
}

二：二分法寻找

#include <stdio.h>
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int s_z = sizeof(arr) / sizeof(arr[0]);
	int such = 7;
	int left = 0;
	int right = s_z - 1 ;
	while (left <= right)
	{
		int mid = (left + right) / 2;
		if (such > arr[mid])
		{
			left = mid + 1;
		}
		else if (such < arr[mid])
		{
			right = mid - 1 ;
		}
		else
		{
			printf("找到了，所求数字的序号为:%d\n", mid);
			break;
		}
	}
	if (left > right)
	{
		printf("找不到");
	}
}