Recursion Via Pascal

J. S. Rohl

ISBN 10: 0521269342 / ISBN 13: 9780521269346

Edité par Cambridge University Press, 2008

A propos de cet article

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.

N° de réf. du vendeur 9780521269346

Détails bibliographiques

• Titre: Recursion Via Pascal
• Éditeur: Cambridge University Press
• Date de parution: 2008
• Langue: anglais
• ISBN à 10 chiffres: 0521269342
• ISBN à 13 chiffres: 9780521269346
• Reliure: Taschenbuch
• État de l'article: Neu

A propos de ce titre

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.