第三十一掌：二分查找算法

#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string.h>
int main(){
	int arr[] = {1,2,3,4,5,6,7,8,9};
	int k = 7;
	int size = sizeof(arr) / sizeof(arr[0]);
	int left = 0;
	int right = size - 1;//如果是char []="abc" 那么就要size-2因为\0在数组下标3的位置，那么right就应该减2
	while(left<=right){
	
		int mid = (left + right) / 2;
		if (arr[mid] > k){
			right = mid - 1;
		}
		else if (arr[mid] < k){
			left = mid + 1;
		}
		else
		{
			printf("找到了，下标是：%d\n", mid); 
			break;
		}
	};
	return 0;
}