Recursion:

1 - How can we define the problem in terms of a smaller problem of the same type?

2 - How does each recursive call diminish the size of the problem?

3 - What instance of the problem can serve as the base case?

4 - Will the base case reached as we diminish the problem size ?

Recursive stack.

Stack of Activation records.

Each activation record is called an instance.

Recurrence relation.

 Examples using recursion stack:

Factorial

Exponents:

Fibonacci:

Functions:

Function name

Return type

Input parameters (Formal arguments)

Actual arguments

Function Scope

Function Method

  C++ program Syntax:

The header files.

The main function.

The Implementation file.

MS C++ .NET Environment:

Creating a Win32 Console project workspace.

Creating header and Implementation files.

Compiling, building and running the executable program

Program Development:

Breakdown.

Refine.

Fundamental Data Types:

int, float, double, bool, unsigned

typecasting.