#include<stdio.h>
#include<stdlib.h>
int main(){
int arr[10] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]) - 1;
int to_find = 8;
while (left <= right){
int mid = (left + right) / 2;
if (to_find > arr[mid]){
left = mid + 1;
}
else if (to_find < arr[mid]){
right = mid - 1;
}
else{
printf("找到了!\n");
break;
}
}
system("pause");
}