From: Georg Bauhaus <bauhaus@futureapps.de>
Subject: Re: Quicksort algorithm in ada
Date: Wed, 12 Apr 2006 20:06:30 +0200
Date: 2006-04-12T20:05:34+02:00 [thread overview]
Message-ID: <443d416e$0$18277$9b4e6d93@newsread2.arcor-online.net> (raw)
In-Reply-To: <443d040b$1@news.uni-rostock.de>
Thomas Krueger wrote:
> Hi
>
> 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 next Ada stadard library is going to have
Ada.Containers.Generic_Anonymous_Array_Sort,
which might be what you want.
If you have a recent GNAT, it's already there.
IIRC, the Booch components contain quicksort, too.
next prev parent reply other threads:[~2006-04-12 18:06 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 [this message]
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
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox