请问我这个代码哪里错了，感激不尽

题目要求是写几个函数：
（1）输入几个职工的姓名和职工编号；
（2）按职工号由小到大顺序排序，姓名顺序也随之调整；
（3）要求输入一个职工号，用折半查找法找出该职工的姓名，从主函数输入要查找的职工号输出职工姓名。
#include<stdio.h>
#include<string.h>
int main()
{
void name(char a[5][100],int b[5]);
void sun(char a[5][100],int b[5]);
void seek(char a[5][100],int b[5],int x);
char a[5][100];
int b[5];
name(a,b);
sun(a,b);
int n;
printf("please enter seek data:");
scanf("%d",&n);
seek(a,b,n);
return 0;
}

void name(char a[5][100],int b[5])
{
int i;
for(i=0;i<5;i++)
{
printf("(%d)please enter name:",i);
gets(a[i]);
printf("(%d)please enter data:",i);
scanf("%d",&b[i]);
getchar();
}
}

void sun(char a[5][100],int b[5])
{
char x[100];
int t,i,j;
for(i=0;i<4;i++)
{
for(j=i+1;j<5;j++)
if(b[i]>b[j])
{
t=b[j];
b[j]=b[i];
b[i]=t;
strcpy(x,a[j]);
strcpy(a[j],a[i]);
strcpy(a[i],x);
}
}
for(i=0;i<5;i++)
printf("%s %d\n",a[i],b[i]);
}

void seek(char a[5][100],int b[5],int x)
{
int mid,left,right,flag=0;
left=0;
right=4;
while(b[left]<=b[right])
{
mid=(left+right)/2;
if(b[mid]==x)
{
flag=1;
break;
}
else if(x<b[mid])
right=mid-1;
else
left=mid+1;
}
if(flag==1)
printf("%s %d",a[mid][100],b[mid]);
else
printf("Don't seek:%d",x);
}

修改如下，供参考：

#include<stdio.h>
#include<string.h>
int main()
{
    void name(char a[5][100], int b[5]);
    void sun(char a[5][100], int b[5]);
    int  seek(char a[5][100], int b[5], int x);  //修改
    char a[5][100];
    int  b[5];
    name(a, b);
    sun(a, b);
    int n;
    printf("please enter seek data:");
    scanf("%d", &n);
    n = seek(a, b, n);  //修改
    if (n >= 0)
        printf("%s %d", a[n], b[n]);
    else
        printf("Don't seek");
    return 0;
}

void name(char a[5][100], int b[5])
{
    int i;
    for (i = 0; i < 5; i++)
    {
        printf("(%d)please enter name:", i);
        gets(a[i]);
        printf("(%d)please enter data:", i);
        scanf("%d", &b[i]);
        getchar();
    }
}

void sun(char a[5][100], int b[5])
{
    char x[100];
    int t, i, j;
    for (i = 0; i < 4; i++)
    {
        for (j = i + 1; j < 5; j++)
            if (b[i] > b[j])
            {
                t = b[j];
                b[j] = b[i];
                b[i] = t;
                strcpy(x, a[j]);
                strcpy(a[j], a[i]);
                strcpy(a[i], x);
            }
    }
    for (i = 0; i < 5; i++)
        printf("%s %d\n", a[i], b[i]);
}

int seek(char a[5][100], int b[5], int x)
{
    int mid, left, right, flag = 0;
    left = 0;
    right = 4;
    while (b[left] <= b[right])
    {
        mid = (left + right) / 2;
        if (b[mid] == x)
        {
            flag = 1;
            break;
        }
        else if (x < b[mid])
            right = mid - 1;
        else
            left = mid + 1;
    }
    if (flag == 1)
        //printf("%s %d", a[mid], b[mid]);  //printf("%s %d", a[mid][100], b[mid]);
        return mid;
    else
        //printf("Don't seek:%d", x);
        return -1;
}