| Recursion Via Pascal Contributor(s): Rohl (Author) |
|||
 |
ISBN: 0521269342 ISBN-13: 9780521269346 Publisher: Cambridge University Press
Binding Type: Paperback - See All Available Formats & Editions Published: July 1984 Annotation: 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. Click for more in this series: Cambridge Computer Science Texts |
||
| Additional Information |
| BISAC Categories: - Computers | Software Development & Engineering - General - Computers | Programming Languages - General |
| Dewey: 005.133 |
| LCCN: 83026335 |
| Series: Cambridge Computer Science Texts |
| Physical Information: 0.47" H x 6" W x 9" L (0.67 lbs) 204 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |
| Customer ReviewsSubmit your own review |
| To tell a friend about this book, you must Sign In First! |
Copyright © 2024 TheReadingWarehouse.com