简易版:
#include <stdio.h>
#define N 10
int main()
{
int a[N]={98,87,76,65,54,43,32,21,10,1};
int mid,loca,top,bott,num;
top=0;
bott=N-1;
mid=(top+bott)/2;
printf("please input a number you look:");
scanf("%d",&num);
for (int i = top; i <= bott; ++i) {
if(a[mid]>num){
top=mid;
mid=(top+bott)/2;
}
if (a[mid]<num){
bott=mid;
mid=(top+bott)/2;
}
if (a[mid]==num){
printf("the number is %d shang\n",mid);
break;
}
}
return 0;
}
精进版:
#include <stdio.h>
#define N 15
int main()
{
int i,number,top,bott,mid,loca,a[N],flag=1,sign;
char c;
printf("enter data:\n");
scanf("%d",&a[0]);
i=1;
while(i<N)
{
scanf("%d",&a[i]);
if (a[i]>=a[i-1])
i++;
else
printf("enter this data again:\n");
}
printf("\n");
for (i=0;i<N;i++)
printf("%5d",a[i]);
printf("\n");
while(flag)
{
printf("input number to look for:");
scanf("%d",&number);
sign=0;
top=0; //top是查找区间的起始位置
bott=N-1; //bott是查找区间的最末位置
if ((number<a[0])||(number>a[N-1])) //要查的数不在查找区间内
loca=-1; // 表示找不到
while ((!sign) && (top<=bott))
{
mid=(bott+top)/2;
if (number==a[mid])
{
loca=mid;
printf("Has found %d, its position is %d\n",number,loca+1);
sign=1;
}
else if (number<a[mid])
bott=mid-1;
else
top=mid+1;
}
if(!sign||loca==-1)
printf("cannot find %d.\n",number);;
printf("continu or not(Y/N)?");
scanf(" %c",&c);
if (c=='N'||c=='n')
flag=0;
}
return 0;
}