Cambridge University Press, Date: 10/14/2008 12:00:01. paperback. Very Good. 0.5100 9.0000 6.0000. Cambridge University Press ISBN 0521269342 9780521269346 [US]

Paperback. Good. Cambridge University Press, 1986. Reprint. Softcover. 6 x 9 ". 191 pp. Good. Previous owner’s blind stamp on the lower tip of the front cover and to the lower tips of some of the inside pages. The text appears unmarked. The binding is solid. ISBN 0521269342 9780521269346 [US]

ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover First Edition Cambridge University Press, 1986. Reprint. Softcover. 6 x 9 ". 191 pp. Good. Previous owner’s blind stamp on the lower tip of the front cover and to the lower tips of some of the inside pages. The text appears unmarked. The binding is solid.
[Running Springs, CA, U.S.A.] [Publication Year: 1984]

ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Very Good condition. Shows only minor signs of wear, and very minimal markings inside (if any). 0.81
[Tucson, AZ, U.S.A.] [Publication Year: 2008]

ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover
[Dallas, TX, U.S.A.] [Publication Year: 2008]

Paperback / softback. New. This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples. ISBN 0521269342 9780521269346 [GB]

ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Buy with confidence! Book is in new, never-used condition 0.81
[Amherst, NY, U.S.A.] [Publication Year: 2008]