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,a909187f2cbcc49d
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,CP1252
Received: by 10.68.223.40 with SMTP id qr8mr10616669pbc.0.1340557731113;
        Sun, 24 Jun 2012 10:08:51 -0700 (PDT)
Path: 
 l9ni15121pbj.0!nntp.google.com!news2.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_So_Who_is_Credited_with_Inventing_=93Count_Sort?=
	=?windows-1252?Q?=94_as_we_know_it_Today_=2D_Anybody=3F?=
Date: Sun, 24 Jun 2012 10:08:50 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <b79ab9ff-bad3-4c17-9d34-d663b8e1a5f6@googlegroups.com>
References: <c0e7f2af-ef13-41e4-8261-fb1d271be6a2@googlegroups.com>
 <4fe726b3$0$9518$9b4e6d93@newsspool1.arcor-online.net>
NNTP-Posting-Host: 31.52.108.135
Mime-Version: 1.0
X-Trace: posting.google.com 1340557730 24962 127.0.0.1 (24 Jun 2012 17:08:50
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sun, 24 Jun 2012 17:08:50 +0000 (UTC)
In-Reply-To: <4fe726b3$0$9518$9b4e6d93@newsspool1.arcor-online.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-24T10:08:50-07:00
List-Id: <comp.lang.ada>

On Sunday, June 24, 2012 3:39:47 PM UTC+1, Georg Bauhaus wrote:
> On 24.06.12 15:26, Austin Obyrne wrote:
>=20
> > But who did invent =93Count Sort=94 on the other hand is something I wo=
uld like to know =96 an individual ?.
>=20
> A standard reference for answering this question would be
> Knuth, Donald E. (1998): The Art of Computer Programming,
> Vol. 3, Sorting and Searching, 2nd Ed.
>=20
> Chances are that classifications and names of all sorts of
> sorting procedures are covered in Chapter 5, on "Sorting"
> (which has 391 pages).
>=20
> A  table of contents is here,
>=20
> http://www.amazon.co.uk/gp/product/toc/0201896850/ref=3Ddp_toc?ie=3DUTF8&=
n=3D266239
>=20
> In particular, section 5.2, titled "Internal Sorting",
> has a subsection  "Sorting by Counting". If this is it,
> Knuth (as in every subsection) collects historical records
> of first mentions of the methods at the end of the subsection.
> In this case,
>=20
> "Sorting by comparison counting (...) was first mentioned in
> print by E.H. Friend [JACM 3 (1956), 152], although he didn't
> claim it as his own invention. Distribution sorting (...) was
> first developed by H. Seward in 1954 for use with radix sorting
> techniques".

Hi Georg,

Many thanks for this information - Iwas able to locate a used copy in "Bett=
erWorldBooks" for only =A36-50.

His first edition was in 1973 and Ada was first published as Ada-83 in 1983=
 so it is probable that the algorithm may have been used in some computer l=
anguage some over the last 30 years.

It is not desperately important but I would like to be able to say that my =
implementation is the first in Ada and is completely independent of the alg=
orithm in 1954 by H. Seaward (hope I've got the name right).

The book might say if there is an implementation in 'C' that I can view jus=
t to compare with my own.

Very grateful,

Austin O'Byrne.