This is the mail archive of the egcs@egcs.cygnus.com mailing list for the EGCS project. See the EGCS home page for more information.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]

Re: About sorting algorithm in glibc

To: schwab@issan.informatik.uni-dortmund.de (Andreas Schwab)
Subject: Re: About sorting algorithm in glibc
From: Jason Merrill <jason@cygnus.com>
Date: 29 Mar 1999 14:05:43 -0800
Cc: getegcs@terrorist.math.ntu.edu.tw, egcs@egcs.cygnus.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

References:
- About sorting algorithm in glibc
  - From: getegcs@terrorist.math.ntu.edu.tw

Prev by Date: Re: scanf() cand read what printf() produced: NaNs and Inf
Next by Date: Re: namespaces with egcs 1.1.2 and Solaris 2.5
Prev by thread: Re: About sorting algorithm in glibc
Next by thread: i386.md move reload_in_progress | reload_completed tests
Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]