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.9 required=5.0 tests=BAYES_50,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c6e96e5cf344d207
X-Google-Attributes: gid103376,public
From: Hans Marqvardsen <hm@ddre.dk>
Subject: Re: Searching and Sorting an Array
Date: 1998/10/20
Message-ID: <362C60B7.5FB2@ddre.dk>#1/1
X-Deja-AN: 403481832
Content-Transfer-Encoding: 7bit
References: <70j0fn$g3i$1@nnrp1.dejanews.com>
 <70jj68$or8$1@samsara0.mindspring.com>
Content-Type: text/plain; charset=us-ascii
Organization: DDRE
Mime-Version: 1.0
Reply-To: hm@ddre.dk_nospam
Newsgroups: comp.lang.ada
Date: 1998-10-20T00:00:00+00:00
List-Id: <comp.lang.ada>

Gerome Miklau wrote:
> 
> I am taking a class where we are using "Ada95: Problem Solving and Program
> Design" by Feldman and Koffman. It has a chapter on arrays and some
> treatment of simple sorting methods, though nothing like you would find in
> an algorithms book.
For Algorithms, try Donald E. Knuth: Sorting and Searching, Addison
Wesley, (first edition 1973).
Its a classic, but still emminently useful. Dont know any better.

-- Hans, hm at ddre dot dk.