Re: My Invention of "Bug Sort".

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

On Wednesday, June 20, 2012 1:51:10 PM UTC+1, Manuel Collado wrote:
> El 20/06/2012 14:47, Manuel Collado escribió:
> > El 20/06/2012 12:57, Austin Obyrne escribió:
> >> ...
> >> Re Your suggestion: "Bug" in engineering is a euphemism for
> >> "error";
> >>
> >> I agree this needs to be changed.
> >>
> >> I originally thought of "Tag Sort" but this clashes with 'tag' in Ada
> >> terminology.
> >>
> >> I'm considering "Cell Sort" (<= elements of an array),"Trap Sort" (<=
> >> data is systematically trapped), "Abstraction Sort" (<= data is
> >> abstracted from the stream of data being assigned to the variable
> >> during runtime of the host program.
> >>
> >> Would any of these clash with other sort program tiles known to you?
> >>
> >> Your suggestion on one of these names would be greatly appreciated.
> >
> > http://en.wikipedia.org/wiki/Bucket_sort
> >
> 
> More precisely:
> 
> http://en.wikipedia.org/wiki/Pigeonhole_sort
> 
> -- 
> Manuel Collado - http://lml.ls.fi.upm.es/~mcollado

Many thanks for this.

I think there is much of a muchness in all of these fine programs.  I guess we all want to be able to say we have invented the best program but this is more an elite group of similar programs from what I can see.

I am claiming that the only restriction to my version of this sort program type is the data type is discrete.

Many thanks for your contibution to my education of sort programs.

Regards - Austin.