This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: What sorting algorithm is used by std::list<>?
- From: "Stephen M. Webb" <stephen dot webb at bregmasoft dot com>
- To: libstdc++ at gcc dot gnu dot org,Dhruv Matani <dhruvbird at gmx dot net>
- Date: Tue, 12 Aug 2003 08:49:11 -0400
- Subject: Re: What sorting algorithm is used by std::list<>?
- Organization: Bregmasoft
- References: <1060675771.2158.1.camel@home.free>
- Reply-to: stephen dot webb at bregmasoft dot com
On August 12, 2003 04:09 am, Dhruv Matani wrote:
> What algorithm for sorting is used by std::list<> It seems to be a
> hybrib of merge sort and something else that I can't figure out. And
> help would be appreciated. Do you have any documentation on this?
The standard requires the list sort function to be a stable sort of NlogN
complexity. Your best bet for documentation is Knuth.
--
Stephen M. Webb