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!news4.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!wns13feed!worldnet.att.net!attbi_s21.POSTED!53ab2750!not-for-mail From: "Jeffrey R. Carter" Organization: jrcarter at acm dot org User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8.0.2) Gecko/20060404 SeaMonkey/1.0.1 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Quicksort algorithm in ada References: <443d040b$1@news.uni-rostock.de> In-Reply-To: <443d040b$1@news.uni-rostock.de> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 12.201.97.176 X-Complaints-To: abuse@mchsi.com X-Trace: attbi_s21 1145464552 12.201.97.176 (Wed, 19 Apr 2006 16:35:52 GMT) NNTP-Posting-Date: Wed, 19 Apr 2006 16:35:52 GMT Date: Wed, 19 Apr 2006 16:35:52 GMT Xref: g2news1.google.com comp.lang.ada:3865 Date: 2006-04-19T16:35:52+00:00 List-Id: 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