DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
Cambridge University Press 2008-10-14 Trade Paperback Very Good Size: 96x8x144; Trade Paperback. Very Good. Name at top of first page, otherwise in excellent condition.
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 Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2008. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2008. Ammareal gives back up to 15% of this item's net price to charity organizations. [Morangis, France] [Publication Year: 2008]
ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2008. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2008. Ammareal gives back up to 15% of this item's net price to charity organizations. [Morangis, France] [Publication Year: 2008]
Cambridge University Press, Date: 2008-10-14. Trade Paperback. Very Good. Trade Paperback. Very Good. Name at top of first page, otherwise in excellent condition.FREE Media Mail Shipping on all U.S. orders over $ 25.00 2008. Cambridge University Press ISBN 0521269342 9780521269346 [US]
ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Trade Paperback. Very Good. Name at top of first page, otherwise in excellent condition. [Bellingham, MA, U.S.A.] [Publication Year: 2008]
ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover First Edition Cambridge University Press, 1986. Reprint. Softcover. 6 x 9 ". 191 pp. Good. Previous owners 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 Book is in Used-Good condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain limited notes and highlighting. 0.81 [Hawthorne, CA, U.S.A.] [Publication Year: 2008]
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]
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]
Cambridge University Press, Date: 1984-08-31. Paperback. New. New. In shrink wrap. Looks like an interesting title! 1984. Cambridge University Press ISBN 0521269342 9780521269346 [US]
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]
ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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. [Einbeck, Germany] [Publication Year: 2008]
ISBN10: 0521269342, ISBN13: 9780521269346, [publisher: Cambridge University Press] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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. [Einbeck, Germany] [Publication Year: 2008]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
