#include<stdio.h>
#define N 10
int num[N];
char name[N][8];
int main()
{
voidinput(void);
voidsort(void);
input();
sort();
intpoint,m;
char c ='Y';
while(c=='Y'||c=='y')
{
printf("\nplease input the num you want to search:\n");
scanf("%d",&m);
getchar();
point = search(m);
if(point==-1)
printf("Can't find him(her)\n");
else printf("the result is :No.%d is%s",num[point],name[point]);
printf("Do you want to continue?(Y/N)");
c=getchar();
}
return0;
}
void input(void)
{
int i =0;
printf("Input the number and name:\n");
printf("No.\t Name\n");
for(i =0;i
{
printf("Input No.:");
scanf("%d",&num[i]);
getchar();
printf("Input name:");
gets(name[i]);
}
getchar();
}//input there is a bug when enter names overcome 8 chars.No todayto deal with it,until writing data structure codes
void sort(void)
{
int i = 0,j= 0,min = 0,temp;
chartemp_char[8];
for(i =0;i
{
min = i;
for(j = i;j
{
if(num[j]
min = j;
}
strcpy(temp_char,name[min]);
strcpy(name[min],name[i]);
strcpy(name[i],temp_char);
temp = num[min],num[min] = num[i],num[i] = temp;
}
printf("\n
The sorted worker-table is:\n");
for(i =0;i
{
printf("%d\t %s\n",num[i],name[i]);
}
}//sort
int search(int m)//bug
{
inttop,bott,mid;
top =0;
bott =N-1;
if(mnum[N-1])
return -1;
while(top<=bott)
{
mid = (top+bott)/2;
if(m==num[mid])
return mid;
else if(m
bott = mid-1;
else
top = mid +1;
}
return-1;
}
#define N 10
int num[N];
char name[N][8];
int main()
{
}
void input(void)
{
}//input there is a bug when enter names overcome 8 chars.No todayto deal with it,until writing data structure codes
void sort(void)
{
}//sort
int search(int m)//bug
{
}