No propriety on this list : ).

My professor tells of books of algoriths containing logical problems,  not
_every_ logical problem but a large set of base problems.  I'm sure you're all
familiar with euclid's algorith for finding the greatest common divisor of two
non-zero integers a and b.  pretty standard fare for comp science folks.  I'll
take a look at boarders this week and have a look see.  I was looking for
something with a little more than the 2 dozen examples and problems that are
in my course book.

Carl Mayer wrote:

> Can you be more specific without compromising propriety?  It is hard for me
> to believe that there could be a book having an algorithm for every logical
> problem (at least the weighs less than my car).
>
> Carl Mayer
> Revolutionary Business Concepts (RBC), Inc.
> mailto:cmayer@revbiz.com
> 913-385-5700 Fax 913-385-5701
> http://www.revbiz.com
>
> -----Original Message-----
> From: owner-kclug@marauder.transwarp.net
> [mailto:owner-kclug@marauder.transwarp.net]On Behalf Of cruller
> Sent: Thursday, September 30, 1999 8:21 AM
> To: Kansas City Linux Users Group
> Subject: kclug - recursive algorithms
>
> Luggers
>
> Do you guys have a fave book (or better web based info) on algorithms
> and more specifically recursive algorithms
>
> I've heard mention of a few books that contain algorithms for almost any
> logical problem you could face.'
>
> Gerald
>
>