Recursion via Pascal

by Rohl, J. S., (Jeffrey Soden)

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Recursion via Pascal / J.S. Rohl.

Summary

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.

Edition Statements

Publication Date:1984.

Publication Statements

Publisher(s):Cambridge University Press
Place of Publication:Cambridge
Language:eng
Publication Date:1984.

Notes

Title from publisher's bibliographic system (viewed on 01 Feb 2016).

The Physical Object

Description:1 online resource (x, 191 pages) : : PDF file(s).

Edition Identifiers

ISBN:9781139171793, 1139171798
oclc:on1269065364
LC Classification:QA76.73.P2
Dewey Decimal:001.64/2

Cover -- Frontmatter -- Contents -- Preface -- Introduction to recursion -- 1.1 Some simple examples -- 1.2 How does recursion work? -- 1.3 The storage cost of recursion -- 1.4 The time cost of recursion -- 1.5 Recurrence relations -- 1.6 The choice of the explicitly defined case -- 1.7 Two-level procedures -- 1.8 Developing the power example: a cautionary tale -- 1.9 Searching -- 1.10 Recursion and reversal -- 1.11 Using recursion indirectly -- Exercises -- Recursion with linked-linear lists -- 2.1 Some simple and general examples -- 2.2 Copying a list -- 2.3 Lists used to hold sequences -- 2.4 Lists as ordered sequences -- 2.5 An example: polynomials -- 2.6 Lists as sets -- 2.7 A large example: multi-length arithmetic -- 2.8 Iteration and linear recursion -- 2.9 More complex data structures -- Exercises -- Recursion with binary trees -- 3.1 Binary search trees -- 3.2 The importance of search trees: balanced trees -- 3.3 Preorder, inorder and postorder procedures -- 3.4 Some general binary recursive tree processing procedures -- 3.5 Expression trees -- 3.6 Writing expression trees -- 3.7 An example: symbolic differentiation -- 3.8 Another example: evaluating an expression -- 3.9 …

Subjects