[comp.theory] seeking advice on good book

davis@pacific.mps.ohio-state.edu ("John E. Davis") (05/27/91)

Hi,

I am looking for a good book to read about computer algorithms, etc.  I
know this is very general so let me tell you my background.

I will receive my PhD in theoretical nuclear physics in August and I have done
alot of numerical programming.  I use `C' as well as `Fortran'.  I have even
done some system programming on VMS and unix (low level QIO and ioctl calls).
I am familiar with complex data structures such as a linked-list.  However, I
have never taken a computer course and as a result I know nothing about trees,
compression schemes, tokens (I am just throwing out words now), etc... and
other things computer science people learn.

I would like to find a book that will fill in some of the gaps in my
knowledge.  Numerical Recipes is always refering to Knuth so perhaps I should
check into it.  I am very good at mathematics and I catch on quickly.  Any
suggestions?

Thanks,
--
John

  bitnet: davis@ohstpy
internet: davis@pacific.mps.ohio-state.edu

clin@eng.umd.edu (Charles Chien-Hong Lin) (05/28/91)

   I'm probably not the right one to be posting a response to this,
but I have time, so why not?  There's Design and Analysis of
Algorithms by Aho, Hopcroft, and, Ullman.  It reads OK.  Usually
taught in a computer science class.  Requires some background
(a little set theory, etc).  There's a book called Algorithmics.
Not as much on specific algorithms, but talks about it at
a general level.  Appears to be geared to non-CS folks.  There's
a new book called Introduction to Algorithms or Algorithms
(can't remember which), and the only author I recall is Rivest
(there are three).   This may be the book to get.  It's new,
and chock full of algorithms.  Nice pictures too.

--
   ____         _
  /    |     __|_|       clin@eng.umd.edu
 |             |         
 |  harles    |  in      "University of Maryland Institute of Technology"
 |          _|
  \_____/  |_|\___/