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

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int arr[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	int to_find = 5;
	int i = 0;
	for (i = 0; i < 10; i++){
		if (arr[i] ==to_find){
			break;
		}
	}
	if (i < 10){
		printf("找到了，下标为：%d", i);
	}else{
		printf("没找到！");
	}
   system("pause");
   return 0;
}

二分查找（前提必须数组有序）可极大提高查找效率！
因此对代码做以下改进：

#include<stdio.h>
#include<stdlib.h>
int main()
{
	int arr[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
	int to_find = 5;
	//[left,right]待查找区间
	int left = 0;
	int right = 10 - 1;
	int mid = 0;
	while (left <= right){
		mid = (left + right)/ 2;
		if (mid>to_find){
			//往左侧找
			right = mid - 1;
		}else if (mid < to_find){
			//往右侧找
			left = mid + 1;
		}else{
			break;
		}
	}
	if (left<=right){
		printf("找到了，下标为：%d\n", mid);
	}else{
		printf("没找到！\n");
	}
   system("pause");
   return 0;
}