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
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,CP1252
Received: by 10.68.219.170 with SMTP id pp10mr6371278pbc.1.1340434215975;
        Fri, 22 Jun 2012 23:50:15 -0700 (PDT)
Path: 
 l9ni9715pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: Austin Obyrne <austin.obyrne@hotmail.com>
Newsgroups: comp.lang.ada
Subject: =?windows-1252?Q?Re=3A_Recapping_on_=93Bug_Sort=94=2E?=
Date: Fri, 22 Jun 2012 23:50:15 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <b6af7f31-17d5-4032-9a65-a9cb8a6ee494@googlegroups.com>
References: <bcf72408-3c1b-4998-bfdc-341af7a6a4cb@googlegroups.com>
 <js2li4$1efv$1@adenine.netfront.net>
NNTP-Posting-Host: 31.52.108.135
Mime-Version: 1.0
X-Trace: posting.google.com 1340434215 2425 127.0.0.1 (23 Jun 2012 06:50:15
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sat, 23 Jun 2012 06:50:15 +0000 (UTC)
In-Reply-To: <js2li4$1efv$1@adenine.netfront.net>
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-22T23:50:15-07:00
List-Id: <comp.lang.ada>

On Friday, June 22, 2012 9:45:53 PM UTC+1, Jeffrey Carter wrote:
> On 06/22/2012 12:55 PM, Austin Obyrne wrote:
> >
> > I have been told that my program resembles a known sort program called
> > =93Counting Sort=94.  I would hate to be guilty of plagiarism and I wou=
ld 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 prog=
ram
> > run-time and assigning the data in such a way that the separate element=
s
> > index their own addresses in the sorting arrays.  A similarity with som=
e
> > other existing paper algorithm is simply fortuitous.
>=20
> What you have presented is an implementation of counting sort, nothing mo=
re.=20
> There is nothing new or unique about your implementation.
>=20
> --=20
> Jeff Carter
> "Apart from the sanitation, the medicine, education, wine,
> public order, irrigation, roads, the fresh water system,
> and public health, what have the Romans ever done for us?"
> Monty Python's Life of Brian
> 80
>=20
>=20
>=20
> --- Posted via news://freenews.netfront.net/ - Complaints to news@netfron=
t.net ---

I am not denying that although I have not inspected "Count Sort" so as to m=
ake a comparison.

Is there any working application that you know of or better still, performa=
nce figures.

Austin O'Byrne.