Re: Recapping on “Bug Sort”.

[Austin Obyrne <austin.obyrne@hotmail.com>]

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
> > “Counting Sort”.  I would hate to be guilty of plagiarism and I would like to
> > point out therefore that the salient thing about my “Parallel Sort” 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 elements
> > index their own addresses in the sorting arrays.  A similarity with some
> > other existing paper algorithm is simply fortuitous.
> 
> What you have presented is an implementation of counting sort, nothing more. 
> There is nothing new or unique about your implementation.
> 
> -- 
> 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
> 
> 
> 
> --- Posted via news://freenews.netfront.net/ - Complaints to news@netfront.net ---

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

Is there any working application that you know of or better still, performance figures.

Austin O'Byrne.