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.6 required=5.0 tests=BAYES_05,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,7bba3224cf6d1d9c
X-Google-Attributes: gid103376,public
From: Tom Moran <tmoran@bix.com>
Subject: Re: Algorithms
Date: 1997/03/13
Message-ID: <33285940.663E@bix.com>#1/1
X-Deja-AN: 225276733
References: <332785AB.41C6@cs.montana.edu>
Organization: InterNex Information Services 1-800-595-3333
Reply-To: tmoran@bix.com
Newsgroups: comp.lang.ada
Date: 1997-03-13T00:00:00+00:00
List-Id: <comp.lang.ada>


There's always the old standy of the Knuth books.  Or something
(slightly) newer like "The Design and Analysis of Computer Algorithms"
by Aho, Hopcroft, and Ullman.  What kinds of algorithms do you need?