3

我有一个struct employee比较器和main：

#define MAX_SIZE 20
typedef struct Employee{
    char name[MAX_SIZE];
    int salary;
    int experience;
} employee_t;

void main()
{
    int i;

    employee_t** employeeArray = (employee_t**)malloc(sizeof(employee_t*)*5);
    employee_t nonExstingEmployee = {"v"};

    for(i=0 ; i < 2 ; i++)
    {
        employeeArray[i] = (employee_t*)malloc(sizeof(employee_t));  //alocate each employee
        readEmployee( employeeArray[i] ); 
    }

    puts("beforesort\n");

    for(i=0; i <2 ; i++)
    {
        printEmployee(employeeArray[i]);
    }

    puts("after salary sort\n");
    qsort(employeeArray, 2, sizeof(employee_t*), compareEmployeesBySalary);
    for(i=0; i < 2 ; i++)
        printEmployee( employeeArray[i] );

    if (bsearch(&nonExstingEmployee, employeeArray, MAX_SIZE, sizeof(employee_t), compareEmployeesByName) == 0)
        puts("employee found");
    else
        puts("no employee found");

}


    int compareEmployeesBySalary(const void* a, const void* b){
            employee_t* one = *(employee_t **)a;
            employee_t* two = *(employee_t **)b;

            if (one->salary == two->salary)
                return 0;
            else if (one->salary > two->salary)
                return 1;
            else
                return -1;
    }

    int compareEmployeesByName(const void* a,const void* b)
    {
        employee_t* one = *(employee_t**)a;
        employee_t* two = *(employee_t**)b;

        if(strcmp(&one->name, &two->name) == 0)
        {
            return 1;
        }

        return 0;
    }

我需要使用bsearch比较名称（与数组中不存在的某些员工），qsort无论我如何初始化员工，我的函数都有效（按薪水比较）因为bsearch它总是说它不存在（我正在尝试测试这个现有员工优先），

我应该如何初始化我的员工（或者我应该改变什么？）

[评论更新：]

这是我的readEmployee()：

void readEmployee(employee_t *emp)
{
  fflush(stdin);
  printf("Please enter Employee's name:(max 19 chars)");
  scanf("%s", emp->name);

  fflush(stdin);
  printf("Please enter Employee's salary:");
  scanf("%d", &(emp->salary));

  fflush(stdin);
  printf("Please enter Employee's experience:");
  scanf("%d", &(emp->experience));
}

我正在比较nonExstingEmployee（存在于数组中进行测试）和我的employeeArray.

4

2 回答 2

2

问题很简单：你qsort有薪水但bsearch有名字。它行不通。

bsearch在有序数组中执行二分查找。不是任何排序数组，而是根据搜索条件排序的数组。您必须以前qsort按名称执行或坚持lsearch（即不依赖于先前排序的线性搜索）。

于 2015-09-06T11:00:27.707 回答
1

我应该如何初始化我的员工

您可能想向我们展示您是如何做到的（readEmployee()？），我们会对此发表评论。

（或者我应该改变什么？）

两个问题：

  1. 要搜索的数组不MAX_SIZE长，但是2.

    所以这条线

    if (bsearch(&nonExstingEmployee, employeeArray, MAX_SIZE, sizeof(employee_t), compareEmployeesByName) == 0)

    应该

    if (bsearch(&nonExstingEmployee, employeeArray, 2, sizeof(employee_t), compareEmployeesByName) == 0)

  2. 在compareEmployeesByName()你传递“错误”的地址。

    这条线

    if(strcmp(&one->name, &two->name) == 0)

    应该

    if(strcmp(one->name, two->name) == 0)
于 2015-09-06T10:48:33.880 回答