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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,ea7ebea8b1d641f0 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newscon06.news.prodigy.com!prodigy.net!newsfeed-00.mathworks.com!nntp.TheWorld.com!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: Quicksort algorithm in ada Date: 12 Apr 2006 13:00:46 -0400 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <443d040b$1@news.uni-rostock.de> NNTP-Posting-Host: shell01.theworld.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: pcls4.std.com 1144861246 4500 192.74.137.71 (12 Apr 2006 17:00:46 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Wed, 12 Apr 2006 17:00:46 +0000 (UTC) User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: g2news1.google.com comp.lang.ada:3795 Date: 2006-04-12T13:00:46-04:00 List-Id: "Thomas Krueger" writes: > 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 GNAT library also has heap sort. - Bob