This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: About sorting algorithm in glibc
- To: schwab at issan dot informatik dot uni-dortmund dot de (Andreas Schwab)
- Subject: Re: About sorting algorithm in glibc
- From: Jason Merrill <jason at cygnus dot com>
- Date: 29 Mar 1999 14:05:43 -0800
- Cc: getegcs at terrorist dot math dot ntu dot edu dot tw, egcs at egcs dot cygnus dot com
- References: <199903270902.RAA09208@terrorist.math.ntu.edu.tw> <vyzk8w04pwy.fsf.cygnus.egcs@issan.cs.uni-dortmund.de>
>>>>> Andreas Schwab <schwab@issan.informatik.uni-dortmund.de> writes:
> GNU libc uses merge sort if it can get the needed space, otherwise resorts
> to quicksort. I don't know what Bentley and Tukey is about, but GNU
> libc's quicksort contains some optimisations from Sedgewick.
Why not use introsort?
http://www.cs.rpi.edu/~musser/gp/index_1.html
Jason