#include <stdio.h>
int search(int a[], int n, int x);
int main()
{
int a[10] = {1,2,3,4,5,6,7,8,9,10};
int b;
printf("请输入所需查找的数:");
scanf("%d", &b);
if(search(int a[10], 10, b) > 0)
{
printf("%d\n", a[find]);
}
else
{
printf("在a[10]中查找不到%d\n", b);
}
return 0;
}
int search(int a[], int n, int x)
{
int low, high, mid, find;
find = -1;
low = 0;
high = n - 1;
while(low <= high)
{
mid = (low + high) / 2;
if(a[mid] > x)
{
high = mid - 1;
}
else if(a[mid] < x)
{
low = mid + 1;
}
else
{
find = mid;
break;
}
return find;
}
}
int search(int a[], int n, int x);
int main()
{
int a[10] = {1,2,3,4,5,6,7,8,9,10};
int b;
printf("请输入所需查找的数:");
scanf("%d", &b);
if(search(int a[10], 10, b) > 0)
{
printf("%d\n", a[find]);
}
else
{
printf("在a[10]中查找不到%d\n", b);
}
return 0;
}
int search(int a[], int n, int x)
{
int low, high, mid, find;
find = -1;
low = 0;
high = n - 1;
while(low <= high)
{
mid = (low + high) / 2;
if(a[mid] > x)
{
high = mid - 1;
}
else if(a[mid] < x)
{
low = mid + 1;
}
else
{
find = mid;
break;
}
return find;
}
}