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,d04d2547435a643e
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Received: by 10.68.191.225 with SMTP id hb1mr12291685pbc.5.1339929352416;
        Sun, 17 Jun 2012 03:35:52 -0700 (PDT)
Path: 
 l9ni60720pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: adacrypt <austin.obyrne@hotmail.com>
Newsgroups: comp.lang.ada
Subject: Re: True or False ?
Date: Sun, 17 Jun 2012 03:35:51 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <67e507a5-940f-4168-becb-0fd614709bea@googlegroups.com>
References: <17029032-5398-4754-8a85-116d595ce59c@googlegroups.com>
 <87haual1o2.fsf@ludovic-brenta.org>
NNTP-Posting-Host: 109.148.165.193
Mime-Version: 1.0
X-Trace: posting.google.com 1339929352 12267 127.0.0.1 (17 Jun 2012 10:35:52
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sun, 17 Jun 2012 10:35:52 +0000 (UTC)
In-Reply-To: <87haual1o2.fsf@ludovic-brenta.org>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=109.148.165.193;
 posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg
User-Agent: G2/1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Date: 2012-06-17T03:35:51-07:00
List-Id: <comp.lang.ada>

On Sunday, June 17, 2012 10:37:17 AM UTC+1, Ludovic Brenta wrote:
> Austin writes on comp.lang.ada:
> > Do you know if these sort programs are used in real world programming
> > today ?
>=20
> In our two-million-line mission-critical software we use heap sort and
> tree sort but not quick sort.
>=20
> --=20
> Ludovic Brenta.

Many thanks.

I have never heard of heap save - is this to be found in academic books?
I'm taking it then that there has not been any huge advance in sorting meth=
ods over the past twenty years.

Could I pick your brains a bit further.

My scheme is ideal for accessing vast programs of millions of lines of sour=
ce code like you mentioned - I tag every variable as it is being keyed in a=
t the outset (at creation time) and then disable it until it is needed (I c=
omment it out ) and if I do need it I simply uncomment it for sorting by a =
specially developed sorting method.  The tags can be stored up front or eve=
n stored in a file in memory for systematic calling by the main program

Perhaps you would have a look at this new method later when I go public.

Question - would it call it a big asset to improve on sorting methods? - gi=
ven that there is so much computer power available to day - poor or even ba=
d methods are getting by without notice?

Many thanks for your help again.

Regards - Austin.