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=0.4 required=5.0 tests=BAYES_00,FORGED_MUA_MOZILLA autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,e0c23e7a19a435c4 X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.228.227 with SMTP id sl3mr8139830pbc.5.1340481652541; Sat, 23 Jun 2012 13:00:52 -0700 (PDT) Path: l9ni11816pbj.0!nntp.google.com!news1.google.com!news2.google.com!news.glorb.com!news.netfront.net!not-for-mail From: Jeffrey Carter Newsgroups: comp.lang.ada Subject: Re: Recapping on =?windows-1252?Q?=93Bug_Sort=94=2E?= Date: Sat, 23 Jun 2012 13:00:48 -0700 Organization: Also freenews.netfront.net; news.tornevall.net Message-ID: References: <169bdbcb-cb43-4db9-9d48-3be2a88473eb@googlegroups.com> <77963856-3a25-4477-9510-769df7a9b85c@googlegroups.com> NNTP-Posting-Host: 184.20.201.198 Mime-Version: 1.0 X-Trace: adenine.netfront.net 1340481651 12223 184.20.201.198 (23 Jun 2012 20:00:51 GMT) X-Complaints-To: news@netfront.net NNTP-Posting-Date: Sat, 23 Jun 2012 20:00:51 +0000 (UTC) User-Agent: Mozilla/5.0 (X11; Linux i686; rv:13.0) Gecko/20120615 Thunderbird/13.0.1 In-Reply-To: Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit Date: 2012-06-23T13:00:48-07:00 List-Id: On 06/23/2012 12:07 PM, Austin Obyrne wrote: > > The very salient thing that everybody is missing is the way the data is > collected and sorted simultaneously in "Parallel Sort" compared to Count > Sort. What you are missing is that you have seen 2 implementations of Counting Sort. The one in Wikipedia is presented as a standalone subprogram that gets an input array of values and sorts it into an output array. This is how a reusable implementation would look. Since Counting Sort is not a general sorting algorithm, few real implementations will look like this. Instead, they will look like: Your implementation, which is not a standalone subprogram nor reusable, that has the operations of the algorithm scattered through the program that is collecting/generating the data to be sorted. -- Jeff Carter "Ah, go away or I'll kill ya." Never Give a Sucker an Even Break 100 --- Posted via news://freenews.netfront.net/ - Complaints to news@netfront.net ---