This preview shows pages 1–6. Sign up to view the full content.
Chapter 15
Recursive Algorithms
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document 2
Recursion
•
Recursion
is a programming technique in
which a method can call itself to solve a
problem
•
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 usually is not
helpful
Basic Elements of Recursion
•
A recursive method is a method that
contains a statement that makes a call to
itself.
•
Any recursive method will include the
following three basic elements:
–
A test to stop or continue the recursion.
–
An end case that terminates the recursion.
–
A recursive call that continues the recursion.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document 4
Recursive Definitions
•
Mathematical formulas often are expressed
recursively
•
N!, for any positive integer N, is defined to be the
product of all integers between 1 and N inclusive
•
This definition can be expressed recursively as:
1!
=
1
N!
=
N * (N1)!
•
The concept of the factorial is defined in terms of
another factorial until the base case of 1! is
reached
Recursive Definitions
5!
5 * 4!
4 * 3!
3 * 2!
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 08/18/2011 for the course COMPUTER S CSC113 taught by Professor Shah during the Spring '09 term at King Saud University.
 Spring '09
 Shah
 Algorithms, Recursion

Click to edit the document details