Re: My Invention of "Bug Sort".

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

On Wednesday, June 20, 2012 1:11:27 AM UTC+1, (unknown) wrote:
> On Tuesday, 19 June 2012 17:13:28 UTC+10, Austin Obyrne  wrote:
> > Copyright © 2012 Austin O'Byrne.
> > 
> > Let us say that “NextNum” is a variable in a program output string that the user wants to sort at the end of the program run.
> > 
> > How it works.
> > 
> > Each change in ‘NextNum’ is trapped as it is computed by a ‘bug’ strategically placed in the lines of source code. 
> > 
> > Q := NextNum(I);
> > I_NUM(Q):= I_NUM(Q)+1;
> 
> How large is Q?

I am treating this sort program more as 'tool' for specific needs now rather than a general sort program following the analysis given me by the previous reader.

In answer to your question, Q is limited only by the computer capacity to provide memory as far as I can see. 

I have written some new "Theoretically Unbreakable" cryptography that is well proven and I was lookin at this as an enhancement which it still is of course but that is as far as it goes.  It may not compete (it might if it comes to that) with other sort programs when it is extended to the broader field of sorting all data types.

See "Skew Line Encryptions - The Eventual Cipher" on 
http://www.adacrypt.com/introduction.html 

This is downloadable and comes with the original compiler (older but perfectly ok) 

Thanks for your interest.

Austin.