comp.lang.ada
 help / color / mirror / Atom feed
From: Austin Obyrne <austin.obyrne@hotmail.com>
Subject: Re: So Who is Credited with Inventing “Count Sort” as we know it Today - Anybody?
Date: Sun, 24 Jun 2012 06:57:15 -0700 (PDT)
Date: 2012-06-24T06:57:15-07:00	[thread overview]
Message-ID: <a927fe9b-93b6-47e3-a49d-6d01dd5df499@googlegroups.com> (raw)
In-Reply-To: <c0e7f2af-ef13-41e4-8261-fb1d271be6a2@googlegroups.com>

On Sunday, June 24, 2012 2:26:27 PM UTC+1, Austin Obyrne wrote:
> I volunteered to draw a line under this topic last evening but on refection I don’t think I should roll over that easily without making a claim to at least re-inventing a close resemblance and perhaps an improved version of that same sort program. 
> 
> I am continuing my claim to have invented a sort program that I am calling “Parallel Sort”.
> 
> Digressing for a while, Charles Babbage (born 1791) is famously credited with breaking the equally famous “Vigenere Cipher” that had lain unbroken for two centuries prior to that.  His modus operandi was based on his noticing that languages have a frequency pattern. 
> 
> In cryptography, if the ciphertext is the same data type as the plaintext it is obfuscating, the illegal cryptanalyst can establish the frequency of the ciphertext and then use this to statistical map the ciphertext in an exploratory way to the plaintext that it originated from. (This statement is hugely over simplistic here) 
> 
> That was the ploy that Babbage invented.
> 
> The Brits are usually fairly honest people about such matters and give credit where credit is due.  The Russian, Friedrich Wilhelm Kasiski  had beaten Charles Babbage to this invention however  by ten years and it is conceded therefore today that it is a joint invention by both Kasiski and Babbage at different times.
> 
> Sorting and checking for repeats is an important process in cryptography to day and a sort program such as I am using is deserving of its place in the history of crypto technology in my view.
> 
> I shall continue therefore to claim my invention of Parallel Sort (Like Babbage) is an independent piece of intellectual property.
> 
> But who did invent “Count Sort” on the other hand is something I would like to know – an individual ?.
> 
> Thanks again for all your helpful comments.
> 
> Austin O’Byrne.

Harold H. Seward was a computer scientist and the developer of the radix sort algorithm in 1954 at MIT.[1] He also developed the counting sort.

I have just noticed this in Wikipedia.

Clearly, since computer science din't come into vogue until the seventies his invention must have been desk top only in 1954 - my invention emanates from  a working program in 2012 that is computer intensive - my claim that I have invented a similar algorithm but a different implementation is perfectly valid.

- adacrypt



  reply	other threads:[~2012-06-24 14:03 UTC|newest]

Thread overview: 7+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2012-06-24 13:26 So Who is Credited with Inventing “Count Sort” as we know it Today - Anybody? Austin Obyrne
2012-06-24 13:57 ` Austin Obyrne [this message]
2012-06-24 14:39 ` Georg Bauhaus
2012-06-24 17:08   ` Austin Obyrne
2012-06-24 17:28     ` Jeffrey Carter
     [not found]     ` <qfofu7ppcifdrqeigsavumrr63vud6783q@invalid.netcom.com>
2012-06-25  7:00       ` Austin Obyrne
2012-06-25  9:36       ` Simon Wright
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox