From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,5052a1cdc3cdb4ab
X-Google-Attributes: gid103376,public
From: Ellis E Hardin <eeh01@gnofn.org>
Subject: Re: Quicksort
Date: 1998/07/30
Message-ID: <6poufn$1e3@junkie.gnofn.org>#1/1
X-Deja-AN: 376233967
References: <01bdbaef$d13c9340$86eba8c2@j.couston>
Organization: Greater New Orleans Free-Net
Newsgroups: comp.lang.ada
Date: 1998-07-30T00:00:00+00:00
List-Id: <comp.lang.ada>

Jamie <j.couston@virgin.net> wrote:
> I was wondering if anyone could help me out with some source code. I wish
> to see a simple implementation of the Quicksort algorithm. As I'm still a
> newcomer to Ada It would only have to deal with arrays of positive integers
> - but please can you make it a recursive NOT iterative process.

Try the Public Ada Library at
<http://wuarchive.wustl.edu/languages/ada/pal.html>.