使用排序 function 和 STL 列表 c++ 时遇到问题，我该如何改进？

Question

This is all in the header file, and in main its pretty simple, I declare a list and then populate it, with no issues, and can print the list from another function that I have in the header file no problems, but the issue comes with the sort function. It keeps saying that it

Severity Code Description Project File Line Suppression State Error C2664 'bool (Bike *,Bike *)':
cannot convert argument 2 from '_Value_type' to 'Bike *' Project7 C:\Program Files (x86)\Microsoft Visual Studio\2019\Community\VC\Tools\MSVC\14.24.28314\include\xutility 1481

//the argument for the sort function

bool comp_id(Bike* b1, Bike* b2)
{
    return b1->id_num < b2->id_num;
}


//This is how I plan on sorting it.
// Also, side note can I do list<Bike> secondList = head; and then sort secondList.sort(comp_id)?

        head.sort(comp_id);
        for (auto iterator = head.begin(); iterator != head.end(); ++iterator)
        {
            cout << iterator->id_num << endl;
        }

//This is the Structure 

struct Bike
{
    char manufact[25];
    int id_num;
    status rented_code; //RENTED/NOT_RENTED
    char to_whom[25];   //to whom bike is rented
    int size;
    float cost_per_day;
    bool deleted;   //to mark bike as deleted in the list.
    Bike* next_manuf;   //pointer to next node in the
                //manufacturers list
    Bike* next_id;  //pointer to the next node
            //in the list by ID
    Bike* next; //pointer to the next node in the general list
};

Answer 1

If head is a list<Bike> your compare function is wrong, it must be

bool comp_id(Bike & b1, Bike & b2)
{
  return b1.id_num < b2.id_num;
}

or better

bool comp_id(const Bike & b1, const Bike & b2)
{
  return b1.id_num < b2.id_num;
}

---

Your compare function would be ok if head was a list<Bike *>