Hello,

I am having a problem sorting a large list. Below is an example.

Code:
#include <iostream>
#include <list>
using namespace std;

void main()
{

	list<int> ints;
	for(int k=0;k<50000;k++) ints.push_back(k);
	ints.sort();
	cout << "ints.size(): " << ints.size() << endl;
}
The number of integers left in ints is 17232, meaning some were lost during ints.sort(). I would like to know what the cause of the problem is and the sorting algorithm used in sort(). Thank you for this information or a link to it.

dremmuel