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,PDS_FROM_2_EMAILS autolearn=no autolearn_force=no
	version=3.4.4
X-Google-Thread: 103376,d04d2547435a643e,start
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 ub6mr12055439pbc.2.1339920606574;
        Sun, 17 Jun 2012 01:10:06 -0700 (PDT)
Path: 
 l9ni60335pbj.0!nntp.google.com!news1.google.com!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
From: "Austin@hotmail.com" <austin.obyrne@hotmail.com>
Newsgroups: comp.lang.ada
Subject: True or False ?
Date: Sun, 17 Jun 2012 01:10:05 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: <17029032-5398-4754-8a85-116d595ce59c@googlegroups.com>
NNTP-Posting-Host: 109.148.165.193
Mime-Version: 1.0
X-Trace: posting.google.com 1339920606 19536 127.0.0.1 (17 Jun 2012 08:10:06
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sun, 17 Jun 2012 08:10:06 +0000 (UTC)
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=windows-1252
Content-Transfer-Encoding: quoted-printable
Date: 2012-06-17T01:10:05-07:00
List-Id: <comp.lang.ada>

I have invented some new data sort methods that are particularly suited to =
Ada and am preparing some script that I will later be posting to a maths gr=
oup to which I belong.

I want to say that the traditional sort methods i.e. quick sort and tree so=
rt etc. in my view are almost benign classroom models not used in the real =
world of computing and programming today and are too inefficient in the way=
 they work i.e. the data must be collected as a string of unsorted data fir=
st of all and then goes through a repetitive reduction process of comparing=
 values and swopping places until there is proper ascending order in the tr=
ansposed string. The whole thing in my view is top heavy with too much =93t=
oo-ing=94 and =93fro-ing=94 and is just too inefficient all round.=20

I am not a professional programmer and I am not even in the industry but I =
have a cracker of a sort program that I will be disseminating free to reade=
rs later although I will be keeping the copyright to guard against commerci=
al marketing to myself for now.=20

To be honest, I am not entirely sure of my ground regarding my statement th=
at tree sort and quick sort not being used and would like to know from any =
of you readers who do know, what is being used today in the real world of p=
rogramming.

I want to be sure that I don=92t make any brash statements that are not ent=
irely true to the maths group.

Do you know if these sort programs are used in real world programming today=
 ?

- adacrypt