From: "Jeffrey R. Carter" <spam.not.jrcarter@acm.not.spam.org>
Subject: Re: Quicksort algorithm in ada
Date: Wed, 19 Apr 2006 16:35:52 GMT
Date: 2006-04-19T16:35:52+00:00 [thread overview]
Message-ID: <IFt1g.933249$xm3.700609@attbi_s21> (raw)
In-Reply-To: <443d040b$1@news.uni-rostock.de>
Thomas Krueger wrote:
>
> Does the quicksort algorithm already exists in the Ada standardlibrary? I
> didn't find it. The only similar thing i found was bubblesort in the gnat
> library...
The PragmAda Reusable Components include an implementation of quick sort. It
uses insertion sort for short arrays and excludes the pivot from recursion. The
library also includes implementations of insertion and heap sorts.
http://pragmada.home.mchsi.com/
--
Jeff Carter
"You couldn't catch clap in a brothel, silly English K...niggets."
Monty Python & the Holy Grail
19
prev parent reply other threads:[~2006-04-19 16:35 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
2006-04-19 16:35 ` Jeffrey R. Carter [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox