From: "Matthew Heaney" <mheaney@on2.com>
Subject: Re: Quicksort algorithm in ada
Date: 13 Apr 2006 13:54:57 -0700
Date: 2006-04-13T13:54:57-07:00 [thread overview]
Message-ID: <1144961697.864184.133770@j33g2000cwa.googlegroups.com> (raw)
In-Reply-To: 443e0aac@news.uni-rostock.de
The original GNAT implementation of Generic_Array_Sort used a
quicksort, but that generic algorithm was recently changed (it was a
few weeks ago) to use a more efficient (and predictable) heap sort.
Check your implementation (I think the gnat runtime files are in
adainclude) to see whether you have the old quicksort or the new
heapsort implementation.
-Matt
next prev parent reply other threads:[~2006-04-13 20:54 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2006-04-12 13:43 Quicksort algorithm in ada Thomas Krueger
2006-04-12 14:22 ` Lutz Donnerhacke
2006-04-12 15:04 ` Gautier
2006-04-12 17:00 ` Robert A Duff
2006-04-12 18:06 ` Georg Bauhaus
2006-04-12 18:11 ` Georg Bauhaus
2006-04-13 8:24 ` Thomas Krueger
2006-04-13 20:54 ` Matthew Heaney [this message]
2006-04-19 16:35 ` Jeffrey R. Carter
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox