>>>>> 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