Recursion via Pascal (Cambridge Computer Science Texts, Series Number 19)

Rohl

ISBN 10: 0521263298 / ISBN 13: 9780521263290

Published by Cambridge University Press, 1984

About this Item

Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned. Ex library copy with usual stamps & stickers.

Seller Inventory # rev3164426697

Bibliographic Details

• Title: Recursion via Pascal (Cambridge Computer Science Texts, Series Number 19)
• Publisher: Cambridge University Press
• Publication Date: 1984
• Language: English
• ISBN 10: 0521263298
• ISBN 13: 9780521263290
• Binding: Hardcover
• Condition: Good
• Weight: 430.9 grams

About this title

Synopsis

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.

Review

'The text is well presented and the content highly readable.' Computer Bulletin

'... 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