From: Brian Drummond <brian@shapes.demon.co.uk>
Subject: Re: More on the “Parallel Sort” Data Sorting Program.
Date: Tue, 3 Jul 2012 14:43:25 +0000 (UTC)
Date: 2012-07-03T14:43:25+00:00 [thread overview]
Message-ID: <jsv0ed$sa0$3@dont-email.me> (raw)
In-Reply-To: 0117b182-7d8f-40ab-8729-6eb258ba5616@googlegroups.com
On Tue, 03 Jul 2012 04:22:43 -0700, Austin Obyrne wrote:
> I ... would like to point out that “Counting “ or “Count sort”
> was invented in 1954.
>
> I quote from Wikipedia,
>
> “Although radix sorting itself dates back far longer, counting sort, and
> its application to radix sorting, were both invented by Harold H. Seward
> in 1954.” - Unquote
>
> Given the state of progress in computer development at that time this
> invention must surely have been more of a longhand algorithm than a
> computer driven program concept.
What do you mean by this? Certainly not that he couldn't have implemented
it and run it on real hardware. Wikipedia places him at MIT where he had
access to a computer for three years by 1954.
- Brian
next prev parent reply other threads:[~2012-07-03 14:43 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
2012-07-03 11:22 More on the “Parallel Sort” Data Sorting Program Austin Obyrne
2012-07-03 14:43 ` Brian Drummond [this message]
2012-07-04 11:12 ` Austin Obyrne
2012-07-04 14:15 ` Austin Obyrne
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox