# Difference between revisions of "Recursive Functions"

Marc Brown (Talk | contribs) (→Online Resources) |
Marc Brown (Talk | contribs) |
||

Line 1: | Line 1: | ||

+ | A definition that defines an object in terms of itself is said to be ''recursive''. In computer science, recursion refers to a function or subroutine that calls itself, and it is | ||

+ | a fundamental paradigm in programming. A recursive program is used for solving problems that can be broken in sub-problems of the same type, doing so recursively until | ||

+ | the problem is easy enough to solve directly. | ||

+ | |||

+ | A common recursive function that you’ve probably encountered is the Fibonacci numbers: 0, 1, 1, 2, 3, 5, 8, 13, and so on. That is, you get the next Fibonacci number by adding together the previous two. Mathematically, this is written as | ||

+ | |||

+ | |||

+ | |||

+ | Try finding F(8). No doubt, you have the correct answer, because you see that F(0)=0 and F(1) = 1. To be formal about this, we need to also define when the recursion stops, called the base cases. In this case, F(0)=1, and F(1)=1. So, the correct definition of the Fibonacci numbers is: | ||

+ | |||

+ | |||

+ | |||

+ | In computer science, we often use the term “recursion” to refer to a procedure (function, subroutine) whose implementation calls itself. Here is an implementation of the Fibonacci function: | ||

+ | |||

+ | |||

+ | int Fibonacci(int x) { | ||

+ | if (x == 0) return 0; | ||

+ | if (x == 1) return 1; | ||

+ | return Fibonacci(x-1) + Fibonacci(x - 2); | ||

+ | } | ||

+ | |||

+ | Consider the factorial function, n!. It is often defined as 1 * 2* 3 … * N-1 * N, with 0! defined as have a value of 1. We can define this recursively as follows: | ||

+ | |||

+ | |||

+ | |||

+ | (We probably should say “x<=0” rather than “x=0” in the base case, to prevent the function from being undefined when x is a negative number.) | ||

+ | |||

+ | int Factorial(int x) { | ||

+ | if (x<=0) return 1; | ||

+ | return x*Factorial(x-1)(; | ||

+ | } | ||

+ | |||

+ | A few definitions: Indirection recursion is when a function calls another function which eventually calls the original function. For example, A calls B, and then, before function B exits, function A is called (either by B or by a function that B calls). Single recursion is recursion with a single reference to itself, such as the factorial example above. And multiple recursion, illustrated by the Fibonacci numbers, is when a function has multiple self references. | ||

+ | |||

+ | The Sierpinski Triangle is an equilateral triangle, subdivided recursively into smaller equilateral triangles: | ||

+ | |||

+ | |||

+ | |||

+ | |||

+ | |||

+ | In computer science, recursion is an important technique for solving problems: One divides a problem into subproblems of the same type, solves each, and combines the results. The breaking down into smaller pieces happens until some “base case” is reached. You often hear this called “divide and conquer”. To use that terminology, Fib(N) is solved by dividing it into Fib(N-1) and Fib(N-2), finding the results of each, and then combining the results by adding them together. Violla! | ||

+ | |||

+ | Many beginning programmers have a real tough time understanding recursion; so if this is confusing to you, not to worry! | ||

+ | |||

+ | In this ACSL category, we’ll focus on mathematical recursive functions rather than programming procedures; but you’ll see some of the latter, no doubt! | ||

+ | |||

+ | � | ||

+ | |||

+ | |||

== Online Resources == | == Online Resources == | ||

## Revision as of 10:17, 31 July 2018

A definition that defines an object in terms of itself is said to be *recursive*. In computer science, recursion refers to a function or subroutine that calls itself, and it is
a fundamental paradigm in programming. A recursive program is used for solving problems that can be broken in sub-problems of the same type, doing so recursively until
the problem is easy enough to solve directly.

A common recursive function that you’ve probably encountered is the Fibonacci numbers: 0, 1, 1, 2, 3, 5, 8, 13, and so on. That is, you get the next Fibonacci number by adding together the previous two. Mathematically, this is written as

Try finding F(8). No doubt, you have the correct answer, because you see that F(0)=0 and F(1) = 1. To be formal about this, we need to also define when the recursion stops, called the base cases. In this case, F(0)=1, and F(1)=1. So, the correct definition of the Fibonacci numbers is:

In computer science, we often use the term “recursion” to refer to a procedure (function, subroutine) whose implementation calls itself. Here is an implementation of the Fibonacci function:

int Fibonacci(int x) {
if (x == 0) return 0;
if (x == 1) return 1;
return Fibonacci(x-1) + Fibonacci(x - 2);
}

Consider the factorial function, n!. It is often defined as 1 * 2* 3 … * N-1 * N, with 0! defined as have a value of 1. We can define this recursively as follows:

(We probably should say “x<=0” rather than “x=0” in the base case, to prevent the function from being undefined when x is a negative number.)

int Factorial(int x) { if (x<=0) return 1; return x*Factorial(x-1)(; }

A few definitions: Indirection recursion is when a function calls another function which eventually calls the original function. For example, A calls B, and then, before function B exits, function A is called (either by B or by a function that B calls). Single recursion is recursion with a single reference to itself, such as the factorial example above. And multiple recursion, illustrated by the Fibonacci numbers, is when a function has multiple self references.

The Sierpinski Triangle is an equilateral triangle, subdivided recursively into smaller equilateral triangles:

In computer science, recursion is an important technique for solving problems: One divides a problem into subproblems of the same type, solves each, and combines the results. The breaking down into smaller pieces happens until some “base case” is reached. You often hear this called “divide and conquer”. To use that terminology, Fib(N) is solved by dividing it into Fib(N-1) and Fib(N-2), finding the results of each, and then combining the results by adding them together. Violla!

Many beginning programmers have a real tough time understanding recursion; so if this is confusing to you, not to worry!

In this ACSL category, we’ll focus on mathematical recursive functions rather than programming procedures; but you’ll see some of the latter, no doubt!

�

## Online Resources

### ACSL

The following videos show the solution to problems that have appeared in previous ACSL contests.

Recursion Example 1 (CalculusNguyenify)
The video walks through the solution to a straight-forward single-variable recursive function, that is, $f(x)=\cases{....}$ The problem appeared in ACSL Senior Division Contest #1, 2014-2015. | |

Recursion Example 2 (CalculusNguyenify)
The video walks through the solution to a 2-variable recursive function, that is, $f(x,y)=\cases{....}$ . The problem appeared in ACSL Senior Division Contest #1, 2014-2015. | |

Recursive Functions ACSL Example Problem (Tangerine Code)
The video walks through the solution to a 2-variable recursive function, that is, $f(x,y)=\cases{....}$ . |

### Other Videos

The follow YouTube videos cover various aspects of this topic; they were created by authors who are not involved (or aware) of ACSL, to the best of our knowledge. Some of the videos contain ads; ACSL is not responsible for the ads and does not receive compensation in any form for those ads.