19-Recursion

# 19-Recursion - Chapter XIX Recursion Chapter XIX Topics...

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

Chapter XIX Recursion Chapter XIX Topics 19.1 Introduction 19.2 Pre-Recursion Assignment 19.3 Recursion Requires an Exit 19.4 Recursion Fundamentals 19.5 Recursive Return Methods 19.6 Fibonacci, a Recursive Nono 19.7 Evaluating Recursive Methods 19.8 Manipulating Parameters of Recursive Methods 19.9 Multiple Recursive Calls and the Tower of Hanoi 19.10 Why Recursion? 19.11 Summary Chapter XIX Recursion 1009

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

View Full Document
19.1 Introduction You probably do not remember too much about recursion. There was only a brief glimpse of recursion introduced back in the second control structure chapter. You do not remember anything? Not to worry, we will start from scratch in this chapter, explaining everything as if you have never heard the word recursion. Recursion is a peculiar kind of control structure. Recursion performs an iterative process, or at least has the same result as an iterative control structure, without using for , while or do. ..while . Recursion is a special process, whereby a method calls itself to simulate iteration. Recursion Definition Recursion is the computer programming process, whereby a method calls itself. Recursion is somewhat of a bizarre topic. You will get a pretty good introduction to recursion during the first year course, but for the real practical reasons to use recursion, you need to wait for the second-year computer science course. Many processes are performed by a computer system recursively. Understanding a computer system thoroughly requires an understanding of recursion. Advanced computer algorithms make liberal use of recursion. Examples of such algorithms would serve little purpose here, but in the future you will certainly need to use recursion. In other words, your teachers and I are doing you a favor. This topic could be skipped with the rationalization of not teaching something that is not used. Let some future teacher wrestle with a topic that really is not used very much right now. But that is not a student friendly approach. The title of this book is Exposure Java , which means that I believe in making the learning process manageable by repeated exposure. It is precisely the introduction of an advanced topic now that will make the learning of such a topic easier at a later date. And for those who plan to take the AP Examination, you will be pleased to know that recursion is very much part of the required knowledge. 1010 Exposure Java 2009, APCS Edition 08-08-09
APCS Examination Alert Recursion is an important topic with frequent questions on both the A and the AB APCS Examination. The A Examination requires that a student can understand and evaluate recursive methods. The A Examination does not require that students generate free response recursive solutions. The

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/14/2010 for the course APSC AP taught by Professor Kurt during the Spring '98 term at Wooster.

### Page1 / 57

19-Recursion - Chapter XIX Recursion Chapter XIX Topics...

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

View Full Document
Ask a homework question - tutors are online