#include<stdio.h>
int main()
{
int a[10]={3,12,77,98,54,26,59,31,62,7}; int i, j, t,high=9,low=0,mid,key;
for (j = 0; j < 9; j++)
for (i = 0; i < 9 - j; i++)
if (a[i] > a[i + 1])
{
t = a[i]; a[i] = a[i + 1]; a[i + 1] = t;
}
printf(“请输入一个要找的数:”);
scanf_s("%d", &key);
while (low <= high)
{
mid = (low + high) / 2;
if (a[mid] > key)
{
high = mid - 1;
}
else if (a[mid] < key)
{
low = mid + 1;
}
else
break;
}
if (low <= high)
{
printf(“该数是数组中的第%d元素\n”, mid+1);
}
else
{
printf(“无此数\n”);
}
return 0;
}
C语言:折半查找
最新推荐文章于 2024-05-14 20:01:57 发布