#include <stdio.h>
int main()//二分法查找元素
{
int arr[] = { 1,2,3,4,5,6,7,8,9 };
int num;
int length = sizeof(arr)/sizeof(int);
int left = 0, right = length - 1;
printf("请输入:");
scanf("%d", &num);
while (left<=right)
{
int middle = (left + right)/2;
if (num == arr[middle])
{
printf("找到%d", arr[middle]);
return 0;
}
if (num < arr[middle])
{
right = middle - 1;
}
else
left = middle + 1;
}
printf("没找到");
return 0;
}