Xref: utzoo comp.lang.c:17378 comp.software-eng:1332
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!haven!adm!smoke!gwyn
From: gwyn@smoke.BRL.MIL (Doug Gwyn )
Newsgroups: comp.lang.c,comp.software-eng
Subject: Re: Texts on fundamentals of programming/computer science
Message-ID: <9966@smoke.BRL.MIL>
Date: 3 Apr 89 18:34:37 GMT
References: <354@cbnewsc.ATT.COM> <WINDLEY.89Mar30143846@Self.cheetah.ucdavis.edu> <9687@orstcs.CS.ORST.EDU> <1203@microsoft.UUCP>
Reply-To: gwyn@brl.arpa (Doug Gwyn (VLD/VMB) <gwyn>)
Organization: Ballistic Research Lab (BRL), APG, MD.
Lines: 11

In article <1203@microsoft.UUCP> w-colinp@microsoft.uucp (Colin Plumb) writes:
>One thing I've wanted for a while ...
>is a cookbook of data structures and algorithms.  Leave in the details (as
>opposed to making them exercises), but make it brief, skip most of the math,
>and explain the boundary cases and implementation issues.

So far the closest I've seen to this is the "Numerical Recipes" series
(Fortran, Pascal, and C versions) by Press, Flannery, Teukolski, and
Vetterling.  I can't say much for their use of C, and occasionally they
pick an ill-advised algorithm, but at least there are a lot of workable
algorithms in most areas of numeric computation.