C++ 按日期排序链表

Question

I want to sort my linked list by date:

void sortuj(List *head)
{
    List curr = *head;
    List next;
    int temp;

    while (curr && curr->next)
    {

    next = curr->next;
        while (next)
        {
            if (curr->year > next->year)
            {
                std::swap(next->day, curr->day);
                std::swap(next->month, curr->month);
                std::swap(next->year, curr->year);
                std::swap(next->hour, curr->hour);
                std::swap(next->minute, curr->minute);
                std::swap(next->length, curr->length);
                std::swap(next->group, curr->group);
                std::swap(next->description, curr->description);
            }
            next = next->next;
        }
        curr = curr->next;
    }
}

It's working now, but just for a year and I have a few more parameters to sort by. I want to sort from oldest to newest, I read all data from file. How can I do it?

Answer 1

If you are using C++11 (or later) an easy way is to use std::tie from <tuple> .

Example use in your code (just guessing here):

if (std::tie(curr->year, curr->month, curr->day)
  > std::tie(next->year, next->month, next->day)) {
...
}

Answer 2

In your function you just compare the year, if there are data with same years, your function can't sort them.

You can convert DMY time to time_t , like:

#include <time.h>
...
time_t convertTime(List& l)
{
    /*struct*/ tm _tm;
    _tm.tm_year = l.year;
    _tm.tm_mon = l.month;
    _tm.tm_mday = l.day;
    _tm.tm_hour = l.hour;
    _tm.tm_min = l.minute;
    _tm.tm_sec = l.second;
    _tm.tm_isdst = 0;
    return mktime(&_tm);
}

time_t refers to the seconds of time in parameters to 1970.