Definition: Recursion is the process where a function is called itself but stack

frame will be out of limit because function call will be infinite times. So a
termination condition is mandatory to a recursion.
In C++, Recursion can be divided into two types:
(a) Run- Time Recursion: Normal as in C
(
Compile- Time Recursion: By using Template

Each of these can be also divided into following types:

1.
2.
3.
4.
5.

Linear Recursion
Binary Recursion
Tail Recursion
Mutual Recursion
Nested Recursion

1. Linear Recursion: This recursion is the most commonly used. In this recursion
a function call itself in a simple manner and by termination condition it
terminates. This process called 'Winding' and when it returns to caller that is
called 'Un-Winding'. Termination condition also known as Base condition.
Example: Factorial calculation by linear recursion
Run-Time Version
01
02
03
04
05
06
07
08
09
10
11

int Fact(long n)
{
if(0>n)
return -1;
if(0 == n)
return 1;
else
{
return ( n* Fact(n-1));
}

Winding Process:

Function called Function return

Fact(6) 6*Fact(5)
Fact(5) 5*Fact(4)
Fact(4) 4*Fact(3)
Fact(3) 3* Fact(2)
Fact(2) 2* Fact(1)
Fact(1) 1* Fact(0)
Terminating Point
Fact(0) 1
Unwinding Process
Fact(1)
Fact(2)
Fact(3)
Fact(4)
Fact(5)
Fact(6)

1*1
2*1
3*2*1
4*3*2*1
5*4*3*2*1
6*5*4*3*2*1

Compile-Time Version
01
02

// template for Base Condition

template <>

03
04
05
06
07
08
09
10

struct Fact<0>
{
enum
{
factVal = 1
};
};

11
12
13
14
15
16
17
18
19

template <int n>

struct Fact
{
// Recursion call by linear method
enum
{
value = n * Fact<n - 1>::factVal
};
};

To test it how it's working at compile time, just call

cout << Fact<-1>::factVal ;
And compile it then compiler error will come, because no template for -1.

2. Binary Recursion: Binary Recursion is a process where function is called twice

at a time inplace of once at a time. Mostly it's using in data structure like
operations for tree as traversal, finding height, merging, etc.
Example: Fibonacci number
Run Time Version Code:
01
02
03
04

int FibNum(int n)
{
// Base conditions
if (n < 1)

05

return -1;

06

if (1 == n || 2 == n)

07

return 1;

08
09

// Recursive call by Binary Method

10

return FibNum(n - 1) + FibNum(n - 2);

function called so

// At a time two recursive

//

11

binary
12 }

Compile Time Version Code

01
02
03
04
05
06
07
08
09
10
11
12
13
14

// Base Conditions
template<>
struct FibNum<2>
{
enum { val = 1 };
};
template <>
struct FibNum<1>
{
enum { val = 1 };
};
// Recursive call by Binary Method
template <int n>

15
struct FibNum
16
{
17
enum { val= FibNum<n - 1>::val + FibNum<n - 2>::val };
18 };

3. Tail Recursion: In this method, recursive function is called at the last. So it's

more efficient than linear recursion method. Means you can say termination
point will come(100%) only you have to put that condition.
Example: Fibonacci number
Run Time Version Code:
01
02
03
04
05
06
07
08
09
10
11

int FibNum(int n, int x, int y)

{
if (1 == n)
{

// Base Condition

return y;
}
else

// Recursive call by Tail method

{
return FibNum(n-1, y, x+y);
}
}

Compile Time Version Code

01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19

template <int n, int x, int y>

struct FibNum
{
// Recursive call By tail method
enum
{
val = FibNum<n-1, y, (x+y)>::val
};
};
// Base Condition or Termination
template<int x, int y>
struct FibNum<1, x, y>
{
enum
{
val = y
};
};

4. Mutual Recursion: Functions calling each other. Let's say FunA calling FunB
and FunB calling FunA recursively. This is not actually not recursive but it's

doing same as recursive. So you can say Programming languages which are not
supporting recursive calls, mutual recursion can be applied there to fulfill the
requirement of recursion. Base condition can be applied to any into one or more
than one or all functions.
Example: To find Even Or Odd number
Run Time Version Code:
01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19

bool IsOddNumber(int n)
{
// Base or Termination Condition
if (0 == n)
return 0;
else
// Recursive call by Mutual Method
return IsEvenNumber(n - 1);
}
bool IsEvenNumber(int n)
{
// Base or Termination Condition
if (0 == n)
return 1;
else
// Recursive call by Mutual Method
return IsOddNumber(n - 1);
}

Compile Time Version Code

01
02

// Base Or Termination Conditions

template <>

03
04
05
06
07
08
09
10

struct IsOddNumber<0>
{
enum
{
val = 0
};
};

11
12
13

struct IsEvenNumber<0>
{
enum

template <>

14
15
16
17
18
19
20

{
val = 1
};
};
// Recursive calls by Mutual Method

21

template <int n>

22
23
24
25
26
27
28
29

struct IsOddNumber
{
enum
{
val = n == 0 ? 0 : IsEvenNumber<n - 1>::val
};
};

30
31

template <int n>

32
33
34
35
36
37
38

struct IsEvenNumber
{
enum
{
val = n == 0 ? 1 : IsOddNumber<n - 1>::val
};
};

3. Nested Recursion: It's very different than all recursions. All recursion can be
converted to iterative (loop) except nested recursion. You can understand this
recursion by example of Ackermann function.
Example: Ackermann function
Run Time Version Code:
01
02
03
04
05
06
07
08
09
10
11
12

int Ackermann(int x, int y)

{
// Base or Termination Condition
if (0 == x)
{
return y + 1;
}
// Error Handling condition
if (x < 0

||

y < 0)

{
return -1;
}

13
14
15
16
17
18
19
20
21
22
23

// Recursive call by Linear method

else if (x > 0 && 0 == y)
{
return Ackermann(x-1, 1);
}
// Recursive call by Nested method
else
{
return Ackermann(x-1, Ackermann(x, y-1));
}
}

Compile Time Version Code

view source
print?
01
02

// Base Or Termination condition

template <int y>

03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

struct Ackermann<0, y>

{
enum { val = y + 1 };
};
// Recursive Call by Linear Method
template <int x>
struct Ackermann<x, 0>
{
enum
{
val = Ackermann<x-1, 1>::val
};
};
// Recursive Call by Nested Method
template <int x, int y>
struct Ackermann
{
Enum
{
val = Ackermann<x-1, Ackermann<x, y-1> ::val>::val
};
};