PxPixel
+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Recursion via Pascal : Cambridge Computer Science Texts - J. S. Rohl

Recursion via Pascal

Cambridge Computer Science Texts

Paperback Published: 24th September 1984
ISBN: 9780521269346
Number Of Pages: 204

Share This Book:

Paperback

Ships in 10 to 15 business days

Earn 144 Qantas Points
on this Book

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.

Industry Reviews

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

Preface
Introduction to recursion
Recursion with linked-linear lists
Recursion with binary trees
Binary recursion without trees
Double recursion, mutual recursion, recursive calls
Recursion with n-ary trees and graphs
Simulating nested loops
The elimination of recursion
Further reading and references
Index of procedures
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521269346
ISBN-10: 0521269342
Series: Cambridge Computer Science Texts
Audience: Tertiary; University or College
Format: Paperback
Language: English
Number Of Pages: 204
Published: 24th September 1984
Publisher: CAMBRIDGE UNIV PR
Country of Publication: GB
Dimensions (cm): 22.86 x 15.24  x 1.19
Weight (kg): 0.3

Earn 144 Qantas Points
on this Book