利用折半查找法（二分查找法）查找员工编号并输出员工的相关资料

 

利用折半查找法（二分查找法）查找员工编号并输出员工的相关资料

 

#include <stdio.h>
#include <string.h>
#define N 5
#define M 30
int flag=1;                               /*全局变量，用于判断search函数的搜索结果*/
main()
{
int num[N],i,j,n;
char name[N][M];
system("cls");
printf("please input %d employees information./n",N);       /*employee：员工、职员、雇员*/
for(i=0;i<N;i++)
{
printf("NO.%d: ",i+1);
scanf("%d ",&num[i]);          /*注意%d之后有个空格，此空格的作用是回收掉数字字符之后至非数字字符以前的全部空格字符，以使打印员工姓名时，名字前面没有空格字符。注意，如果%d后加了空格，search函数中的整形变量low的初值必须赋为0，否则可为1*/
for(;!(num[i]>=0&&num[i]<=32767);)                    /*因为数组num被定义为int型，所以当num[i]的值大于32767时就提示有错，并要求重新赋值*/
{
printf("Error! Input again: /a");
scanf("%d ",&num[i]);
}
gets(name[i]);                     /*用gets函数作为输入语句的好处在于可以输入空格，而使用scanf("%s",&name[i])的话，输入时一旦遇到空格，空格以后的字符就将被下一组元素所接收，会影响程序的输出结果*/
}
system("cls");
printf("All information:/n");
for(i=0;i<N;i++)
printf("No.%d: employee:%s, Number:%d/n",i+1,(name[i][0]=='')?strcat(name[i],"NONE"):name[i],num[i]);
puts('');
than(num,name);
printf("Input will search number: ");
scanf("%d",&n);
j=search(num,n);
if(!flag) printf("Can't find '%d', search is not success./n",n);                          /*success：成功*/
else printf("'%d' position is %d, name is %s./n",n,j+1,name[j]);                  /*position：位置*/
}

than(int str[],char st[][M])                                       /*自定义函数than用于顺序排列员工编号和姓名*/
{
int i,j,max;
char temp[M];
for(i=0;i<N-1;i++)
for(j=i+1;j<N;j++)
if(str[i]>str[j])                                                     /*如果把if(str[i]>str[j])改为if(str[i]<str[j])，则是按从大到小的顺序对数组进行重新排列*/
{
max=str[i];
str[i]=str[j];
str[j]=max;
strcpy(temp,st[i]);                                              /*注意系统函数strcpy的使用方法*/
strcpy(st[i],st[j]);                                                 /*注意系统函数strcpy的使用方法*/
strcpy(st[j],temp);                                              /*注意系统函数strcpy的使用方法*/
}
for(i=0;i<N;i++)
printf("New:%d, %s/n",str[i],st[i]);                  /*输出顺序排列后的数组元素*/
}

int search(int str[],int n)                                   /*自定义函数search用于查找输入的编号*/
{
int low=0,high=N,mid=0;                                /*low表示第一个数组元素序列，high表示数组元素的总数*/
if(n<str[0]||n>str[high-1]) {flag=0;return 0;}
while(low<=high)                                                                    
{                                                                                                  
mid=(low+high)/2;                                                                    
if(n>str[mid]) low=mid+1;                                                      
else if(n<str[mid]) high=mid-1;                                            
else return mid;                                                                      
}                                                                                                  
if(low>high) {flag=0;return 0;}                    /*蓝色部分为二分查找法（或称折半查找法）的算法*/                           
return mid;
}