如何快速分配用户输入

时间:2015-07-27 20:41:17

标签: c algorithm sorting quicksort

问题相当简单,但我搜索的越多,我就越困惑。我应该从我编写的结构代码中快速输入一个变量。但是,我不明白如果它在循环的每次迭代中都改变了,我应​​该如何快速输入像em.fName这样的变量。我查找的每个示例似乎都对int变量或预定义的字符数组进行排序。有人能指出我在哪里开始和/或在C中给出一个例子吗?谢谢,非常感谢。我posted the full code here 因为我不想弄乱这个帖子。

    typedef struct EmployeeRecord
    {
    STR21 lName;
    STR11 fName;
    char fullName[33];
    float hrs;
    float pay;
    float dfr;
    float gross;
    float ft;
    float st;
    float ssit;
    float net;

    } EmployeeRecord;

int main(void)
{
    EmployeeRecord em;

    do
    {
        counter++;
        em.dfr = em.ft = em.st = em.ssit = em.gross = em.hrs = em.pay = em.net = ovrtHrs = 0; //initalized to 0 and then changed by function if greater than 0
        printf("Please enter your FIRST name: ");
        scanf("%s",fName);
        printf("Please enter your LAST name: ");
        scanf("%s",lName);
        printf("Enter your payrate: ");
        scanf("%f",&em.pay);
        printf("Please enter your total hours: ");
        scanf("%f",&em.hrs);
        printf("Please enter the amount of deferred earnings: ");
        scanf("%f",&em.dfr);

        strcpy(fullName,lName); // combine last + ", " + first into full
                strcat(fullName,", ");
                strcat(fullName,fName);

        payTotal = payTotal + em.pay;
        dfrTotal = dfrTotal + em.dfr;

        em.gross = grossModule(&em.hrs,em.pay,&ovrtHrs); // call 3.4
        CalculateTaxes(&em.gross,&em.dfr,&em.ft,&em.st,&em.ssit); // call 3.0
        em.net = netModule(&em.gross,&em.ft,&em.st,&em.ssit); // cal 3.5

        hoursTotal = hoursTotal + em.hrs;
        overtimeTotal = overtimeTotal + ovrtHrs; // TOTALS
        grossTotal = grossTotal + em.gross;
        stateTotal = stateTotal + em.st;
        ssiTotal = ssiTotal + em.ssit;
        netTotal = netTotal + em.net;
        fedTotal = fedTotal + em.ft;

        fprintf(myreport,REPORTCOLUMNFORMATS,em.fullName,em.pay,em.hrs,em.gross,em.ft,em.ssit,em.net);
        fprintf(myreport,REPORTCOLUMNFORMATS3,ovrtHrs,em.st,em.dfr);


        printf("Would you like to continue, y/n? \n");
        scanf("%s",&ask);

    }while(ask == 'y' || ask == 'Y');

1 个答案:

答案 0 :(得分:2)

以下是一些提示:

  1. 您只是阅读一个EmployeeRecord然后被覆盖,如果您想对它们进行排序,则必须将它们全部保存。您可以使用realloc动态更改保留空间的大小或保持简单:

    EmployeeRecord employees[100]; // will fail if more than 100 employees are added
    ...
    // after em is complete:
    employees[counter++] = em; // remove the other counter++
    
  2. 从wikibooks.org中取样并用普通的int替换指针,使用索引代替指针数学(更容易理解)并添加了必须填充的比较函数:

    void swap(int a, int b)
    {
        EmployeeRecord tmp = employees[a];
        employees[a] = employees[b];
        employees[b] = tmp;
    }
    
    int compare(int a, int b)
    {
        // return -1 if employees[a] comes before employees[b]
        // return  1 if employees[a] comes after employees[b]
        // return  0 "if they have the same order"
        //           (stable algorithms e.g. mergesort won't change the order of those)
    }
    
    void quicksort(int begin, int end)
    {
        int ptr;
        int split;
        if (end - begin <= 1)
            return;
        ptr = begin;
        split = begin + 1;
        while (++ptr <= end) {
            if (compare(ptr, split) > 0) { // sorts ascending
                swap(ptr, split);
                ++split;
            }
        }
        swap(begin, split - 1);
        quicksort(begin, split - 1);
        quicksort(split, end);
    }
    
  3. 在用户决定不再继续之后对报告进行排序和创建。