Question

I have a struct

typedef struct  
{ 
    int id;  
    string name;  
    string address;
    string city;  
    // ...
} Customer;

I will have multiple customers so I need to store these structs in some sort of a list and then I need to sort by id. There a probably multiple solutions here and I have a few ideas myself but I am looking for the best solution in terms of performance.

Answer 1

Use the sort provided by the stl algorithms package, example:

struct Customer {
    int id;
    Customer(int i) : id(i) {}
};

bool sortfunc(struct Customer i, struct Customer j) {
    return (i.id < j.id);
}

int main() {
    vector<Customer> customers;
    customers.push_back(Customer(32));
    customers.push_back(Customer(71));
    customers.push_back(Customer(12));
    customers.push_back(Customer(45));
    customers.push_back(Customer(26));
    customers.push_back(Customer(80));
    customers.push_back(Customer(53));
    customers.push_back(Customer(33));

    sort(customers.begin(), customers.end(), sortfunc);

    cout << "customers:";
    vector<Customer>::iterator it;
    for (it = customers.begin(); it != customers.end(); ++it)
        cout << " " << it->id;

    return 1;
}