From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.0 required=5.0 tests=BAYES_00,FORGED_HOTMAIL_RCVD2,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,f6c360ce344b2364
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,CP1252
Received: by 10.68.234.38 with SMTP id ub6mr22034407pbc.2.1340183106726;
        Wed, 20 Jun 2012 02:05:06 -0700 (PDT)
Path: 
 l9ni71829pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: Austin Obyrne <austin.obyrne@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: My Invention of "Bug Sort".
Date: Wed, 20 Jun 2012 01:51:59 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <517e8f66-0239-401a-b952-a72de4961bde@googlegroups.com>
References: <3852c348-a728-44ed-b065-c8a596c1e235@googlegroups.com>
 <d2ffac4f-3a19-479c-aab6-700db4fb4fe9@googlegroups.com>
NNTP-Posting-Host: 86.171.156.227
Mime-Version: 1.0
X-Trace: posting.google.com 1340183106 10390 127.0.0.1 (20 Jun 2012 09:05:06
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Wed, 20 Jun 2012 09:05:06 +0000 (UTC)
In-Reply-To: <d2ffac4f-3a19-479c-aab6-700db4fb4fe9@googlegroups.com>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=86.171.156.227;
 posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg
User-Agent: G2/1.0
Content-Type: text/plain; charset=windows-1252
Content-Transfer-Encoding: quoted-printable
Date: 2012-06-20T01:51:59-07:00
List-Id: <comp.lang.ada>

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 =A9 2012 Austin O'Byrne.
> >=20
> > Let us say that =93NextNum=94 is a variable in a program output string =
that the user wants to sort at the end of the program run.
> >=20
> > How it works.
> >=20
> > Each change in =91NextNum=92 is trapped as it is computed by a =91bug=
=92 strategically placed in the lines of source code.=20
> >=20
> > Q :=3D NextNum(I);
> > I_NUM(Q):=3D I_NUM(Q)+1;
>=20
> How large is Q?

I am treating this sort program more as 'tool' for specific needs now rathe=
r than a general sort program following the analysis given me by the previo=
us reader.

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

I have written some new "Theoretically Unbreakable" cryptography that is we=
ll proven and I was lookin at this as an enhancement which it still is of c=
ourse but that is as far as it goes.  It may not compete (it might if it co=
mes to that) with other sort programs when it is extended to the broader fi=
eld of sorting all data types.

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

This is downloadable and comes with the original compiler (older but perfec=
tly ok)=20

Thanks for your interest.

Austin.