Using C++ to Define Recursive Functions

Standard:

CCSS.MATH.CONTENT.HSF.IF.A.3
Recognize that sequences are functions, sometimes defined
recursively, whose domain is a subset of the integers.

Assessment:

Formative:
The ability of the students to recognize recursion will be
observed throughout the process, and more instruction could
be given if students are struggling individually or within their
groups.
Summative:
Given a sequence of numbers ({5,13,21,29,}), a student will
be able to represent the sequence as a function.

Lesson/Activity:

After being introduced to sequences and how to define them as

functions the day before, students will be using the C++ programming
language to recursively find one of the most interesting sequences in
mathematics.
The Fibonacci Numbers (1,1,2,3,5,8,13,...) are found by adding the
two numbers that appear before any number together. Accomplishing
this in a program will require students to use the programming
concept known as recursion. After an introduction into what recursion
is and how it can be done in C++, students will be given the code for
calculating the nth Fibonacci Number.
Their task will be to implement this code in a program. In addition,
students will have to comment the code for the Fibonacci Number
function to illustrate that they understand what it is doing.
Students must demonstrate their working program to the instructor to
receive full credit, and a copy of their documented code must be
provided.

Outcome Statement:

Students can translate sequences into functions and define their

domains.

Essential Questions
Addressed:

Whats the importance of recursively defining a function, and what

kind of power does that give programmers?

Post Lesson
Reflection: