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=2.1 required=5.0 tests=BAYES_05,INVALID_DATE,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,27703d259b4784f5,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-11-28 06:40:40 PST
Newsgroups: comp.lang.ada
Path: 
 nntp.gmd.de!xlink.net!howland.reston.ans.net!pipex!warwick!sunserver1.aston.ac.uk!usenet
From: sidhuj@aston.ac.uk (J SIDHU)
Subject: Quickest way to order data
Message-ID: <CzzEEE.AzC@aston.ac.uk>
Sender: usenet@aston.ac.uk
Reply-To: sidhuj@aston.ac.uk
Organization: Aston University
Date: Mon, 28 Nov 1994 14:18:14 GMT
Date: 1994-11-28T14:18:14+00:00
List-Id: <comp.lang.ada>


What is the quickest way of ordering data 
(specifically words) into an alphabetical
list?? I'm pretty new to Ada, though I
have other language experience.
Also how do you set up andconfigure a 
binary tree in Ada

Any info would be useful

John
Please mail me info at
sidhuj@aston.ac.uk