From: Gautier <gautier@fakeaddress.nil>
Subject: Re: Quicksort algorithm in ada
Date: Wed, 12 Apr 2006 17:04:40 +0200
Date: 2006-04-12T17:04:40+02:00 [thread overview]
Message-ID: <443d1723$1_6@news.bluewin.ch> (raw)
In-Reply-To: <443d040b$1@news.uni-rostock.de>
Thomas Krueger:
> 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...
>
> Do you know the trick or a link to a good Ada implementation of quicksort.
You'll find one there (non-recursive), among other algorithms:
http://www.mysunrise.ch/users/gdm/e3d_html/eng3dsor__adb.htm
The key array sorted there is "Center_Z" and another
array "Order" is sorted at the same time.
Should be easy to make it generic or specific to any application.
HTH
_______________________________________________________________
Gautier -- http://www.mysunrise.ch/users/gdm/index.htm
Ada programming -- http://www.mysunrise.ch/users/gdm/gsoft.htm
NB: For a direct answer, e-mail address on the Web site!
next prev parent reply other threads:[~2006-04-12 15:04 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 [this message]
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
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox