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.0 required=5.0 tests=BAYES_00,FORGED_HOTMAIL_RCVD2, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,e0c23e7a19a435c4,start X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,CP1252 Received: by 10.68.228.227 with SMTP id sl3mr4574829pbc.5.1340395299534; Fri, 22 Jun 2012 13:01:39 -0700 (PDT) Path: l9ni7993pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail From: Austin Obyrne Newsgroups: comp.lang.ada Subject: =?windows-1252?Q?Recapping_on_=93Bug_Sort=94=2E?= Date: Fri, 22 Jun 2012 12:55:16 -0700 (PDT) Organization: http://groups.google.com Message-ID: NNTP-Posting-Host: 31.52.108.135 Mime-Version: 1.0 X-Trace: posting.google.com 1340395299 28789 127.0.0.1 (22 Jun 2012 20:01:39 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Fri, 22 Jun 2012 20:01:39 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=31.52.108.135; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg User-Agent: G2/1.0 Content-Type: text/plain; charset=windows-1252 Content-Transfer-Encoding: quoted-printable Date: 2012-06-22T12:55:16-07:00 List-Id: Several things have been pointed out to me by informed readers that I have = taken on board. I appreciate the good intention and am truly grateful for = the advice. First of all I have been told that the name is unbecoming and I am changing= it therefore to =93Parallel Sort=94 because of the way it works in paralle= l and concurrently with a computer program at run time. Any number of variables in a computer program may be tracked simultaneously= and the changing values are written to dedicated sorting arrays and sorted= immediately as they occur in an ongoing process. This obviates double han= dling of data that needs to be sorted by the user i.e in not having to coll= ect it retroactively by some other means and then sorting it in a separate = secondary operation. I have been told that my program resembles a known sort program called =93C= ounting Sort=94. I would hate to be guilty of plagiarism and I would like = to point out therefore that the salient thing about my =93Parallel Sort=94 = is that my implementation is geared to capturing data during any unrelated = program run-time and assigning the data in such a way that the separate ele= ments index their own addresses in the sorting arrays. A similarity with s= ome other existing paper algorithm is simply fortuitous. I am not on the make for anything like fame or fortune (perish the thought)= but in fairness I think that where discrete data is a conditional caveat (= i.e. general sorting that would include float data type is not being claime= d), I have invented a useful tool in programming and in computer science th= at previously did not exist. It is acknowledged that this sort program is l= imited to discrete data types only. The invention has an attractive =93time complexity =93 rating. Tests to date indicate 14250 integers sorted in less that 1 second =96 much= better results are expected later =96 the development is ongoing. I would like to thank everybody who has helped me in this matter recently. -Austin O=92Byrne.