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.
"synopsis" may belong to another edition of this title.
'... a pleasing and useful elementary textbook on recursion. The didactic style and practical orientation of the book should encourage and enable students to master recursion ...' The Times Higher Education Supplement
'The text is well presented and the content highly readable.' Computer Bulletin
"About this title" may belong to another edition of this title.
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. 1st Edition. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP78900228
Seller: R. Rivers Books, Running Springs, CA, U.S.A.
Soft cover. Condition: Good. 1st 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. Seller Inventory # BOOK2-050117004
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Paperback. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0521269342
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 191 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand. Seller Inventory # __0521269342
Quantity: 1 available
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521269346
Quantity: 10 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521269346
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580248090
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 204. Seller Inventory # 26542298
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 204 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 8386949
Quantity: 4 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. This book is devoted to recursion in programming, the technique through 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, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore 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, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through 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, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore 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, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521269346