L13-Recursion3

# L13-Recursion3 - Recursion Recursion is a fundamental...

This preview shows pages 1–5. Sign up to view the full content.

Recursion 11 -1 Recursion is a fundamental programming technique that can provide an elegant solution certain kinds of problems Chapter 12 focuses on: thinking in a recursive manner programming in a recursive manner the correct use of recursion recursion examples

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Recursive Thinking 11 -2 A recursive definition is one which uses the word or concept being defined in the definition itself When defining an English word, a recursive definition is often not helpful But in other situations, a recursive definition can be an appropriate way to express a concept Before applying recursion to programming, it is best to practice thinking recursively
Recursive Definitions 11 -3 Consider the following list of numbers: 24, 88, 40, 37 Such a list can be defined as follows: A LIST is a: number or a: number comma LIST That is, a LIST is defined to be a single number, or a number followed by a comma followed by a LIST The concept of a LIST is used to define itself

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Recursive Definitions 11 -4 The recursive part of the LIST definition is used several times, terminating with the non-recursive part: number comma LIST 24 , 88, 40, 37 number comma LIST 88 , 40, 37 number comma LIST 40 , 37 number 37
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/18/2011 for the course CSE 205 taught by Professor Matasu during the Spring '08 term at ASU.

### Page1 / 21

L13-Recursion3 - Recursion Recursion is a fundamental...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online