Xref: utzoo comp.software-eng:954 comp.lang.c:14614 comp.lang.c++:2223 comp.lang.fortran:1608 comp.lang.lisp:1280
Path: utzoo!utgpu!watmath!clyde!bellcore!rutgers!rochester!kodak!ektools!thomas
From: thomas@ektools.UUCP (Thomas B. Kinsman)
Newsgroups: comp.software-eng,comp.lang.c,comp.lang.c++,comp.lang.fortran,comp.lang.lisp
Subject: REFERENCES FOR ALGORITHMS
Keywords: ALGORITHM, DESIGN
Message-ID: <1628@ektools.UUCP>
Date: 8 Dec 88 22:28:49 GMT
Expires: 22 Dec 88 05:00:00 GMT
Reply-To: thomas@ektools.UUCP (Thomas B. Kinsman)
Organization: Eastman Kodak, Dept. 47, Rochester NY
Lines: 21


   ~~~  Please reply directly to the author.  ~~~
   Note:	This is a language independent question.
		It may be cross posted.
   Note:	This is a question on DESIGN, NOT on implementation.
   Question:	Which books are frequently used as INITIAL 
		references for algorithm design?
   Situation:	Imagine you know what you want to do, and you are about
   		to look in a book to see what methods have been used before.
	   	You aren't doing anything out of the mainstream like strange 
		attractor modeling...  
		You are about to do a search on a tree, a hashing function...
   i.e.:	***  Which book do YOU go to first???  ***
   Reply:	Please mail directly to ME.  Serious responses only please.
   Results:	I will post a list on December 22, 1988,
   		and you can all tear it apart then.
   Thanks:	In advance for all those that respond.
   Joke:	"We asked two thousand Software Engineers, if stranded in orbit, 
		 which reference they would want to have along."
   Author:	Thomas B. Kinsman
   		...rochester!kodak!ektools!thomas