Question

Basically, anyone knows, what should be the Big-O notation (needed for the assignment) for the sort() function of the new C++11 forward_list class?

Just a small working example of it: reading from a file:

std::forward_list<string> words3;
ifstream songs;
songs.open ("songs.txt");
string line;

while (songs){
    getline (songs, line);
    words3.push_front(line);
}
words3.sort();

Thanks in advance.

Answer 1

Check the C++11 standard §23.3.4.6/23.

Complexity: Approximately N log N comparisons, where N is distance(begin(), end()).