ESc101 S 10 Recursion

Recursion in C
Fundamentals of Computing (ESc 101A)

Lecture Notes 10
Raghunath Tewari
rtewari@cse.iitk.ac.in
Indian Institute of Technology, Kanpur
Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Recursion in C
What is Recursion?

Recursion in C
What is Recursion?
Recursive Function in C
A function defined in terms of itself is called a recursive function.
The process is known as recursion.
Some examples:

Recursion in C
What is Recursion?
Some examples:
- Factorial: n! = n (n 1)!

Recursion in C
What is Recursion?
Some examples:
- Fibonacci numbers: F (n) = F (n 1) + F (n 2)

Recursion in C
What is Recursion?
Some examples:
The argument must change in between calls.

Recursion in C
What is Recursion?
Some examples:
There must be one or more base case (also known as stopping
condition).

Recursion in C
What is Recursion?
Some examples:
condition).
- Factorial: 1! = 1.

Recursion in C
What is Recursion?
Some examples:
condition).
- Fibonacci numbers: F (1) = 1 and F (2) = 1.

Recursion in C
What is Recursion?
Some examples:
condition).
- Fibonacci numbers: F (1) = 1 and F (2) = 1.
Argument values move towards the base case.

Recursion in C
Recursion in C
Example of a Recursive Function Factorial Function
1 #include<stdio.h>
2
3 int fact(int n){
4 if (n==0) return 1;
5 else return n*fact(n-1);
6 }
7
8 int main(){
9 int n, f;
10 scanf("%d", &n);
11 f = fact(n);
12 printf("Factorial(%d) = %d\n
",n,f);
13 return 0;
14 }

Recursion in C
Recursion in C
1 #include<stdio.h> The function fact takes an

2
integer n as argument and
3 int fact(int n){
returns the factorial of n.
5 else return n*fact(n-1);
6 }
7
8 int main(){
9 int n, f;
10 scanf("%d", &n);
11 f = fact(n);
",n,f);
13 return 0;
14 }

Recursion in C
Recursion in C

2
3 int fact(int n){
5 else return n*fact(n-1); Calls to function fact:
6 } - First Call: Line 11 (from
7
main function).
8 int main(){ - Subsequent Calls: Line 5
9 int n, f;
(from fact function).
10 scanf("%d", &n);
11 f = fact(n);
",n,f);
13 return 0;
14 }

Recursion in C
Recursion in C

2
3 int fact(int n){
7
main function).
9 int n, f;
10 scanf("%d", &n);
11 f = fact(n); Argument of fact decreasing
12 printf("Factorial(%d) = %d\n in successive calls.
",n,f);
13 return 0;
14 }

Recursion in C
Recursion in C

2
3 int fact(int n){
7
main function).
9 int n, f;
10 scanf("%d", &n);
",n,f);
13 return 0;
How many calls are made,
14 } say when n = 6?

Recursion in C
Recursion in C

2
3 int fact(int n){
7
main function).
9 int n, f;
10 scanf("%d", &n);
",n,f);
13 return 0;
How many calls are made,
14 } say when n = 6?
7 calls.

Recursion in C
Recursion in C
Memory Usage by Recursive Functions
Whenever a call is made to a

function, space is reserved in
the stack for the function
arguments and the variables
declared inside the function.

Recursion in C
Recursion in C

arguments and the variables
For recursive functions,
separate space is created for
each call to the function.
Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
fact(0)

fact(1)
arguments and the variables fact(2)
fact(3)
separate space is created for
main
each call to the function.

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
fact(0)

fact(1)
fact(3)
separate space is created for 3
main
each call to the function. n f

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
fact(0)

fact(1)
declared inside the function. 3
fact(3)
For recursive functions, n
main

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
fact(0)

fact(1)
the stack for the function 2
n
fact(3)
main

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
fact(0)
Whenever a call is made to a 2

fact(1)
function, space is reserved in n
n
fact(3)
main

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
0
fact(0)
n
fact(1)
n
fact(3)
main

3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
0
fact(0)
n
fact(1)
n
fact(3)
main
Order of
Function Calls
3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
Return Values
0
fact(0) 1
n
fact(1) 1
arguments and the variables fact(2) 2
n
fact(3) 6
main
Order of
Function Calls
3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
Return Values
0
fact(0) 1
n
fact(1) 1
n
fact(3) 6
separate space is created for 3 6
main
Order of
Function Calls

Recursion in C
Recursion in C
Return Values
0
fact(0) 1
n
fact(1) 1
n
fact(3) 6
separate space is created for 3 6
main
Order of
Function Calls
3*(2*(1*fact(0)))= 3*(2*(1*1))= 3*(2*1)= 3*2 = 6
Recursion in C
Recursion in C
Example n choose k (Definition)
Binomial Coefficient (n choose k)

Non-recursive Definition

n n!
=
k k! (n k)!

Recursion in C
Recursion in C


n n!
=
k k! (n k)!
Recursive Definition

n n1 n1
= + for 1 k n 1
k k 1 k

n n
= = 1 for n 0 (Base Case)
0 n

Recursion in C
Recursion in C


n n!
=
k k! (n k)!

n n1 n1
= + for 1 k n 1
k k 1 k

n n
= = 1 for n 0 (Base Case)
0 n
Note: In each recursive step, value of n decreases. Value of k may
or may not decrease. Recursion stops when n = k or k = 0.
Recursion in C
Recursion in C
Example n choose k (Program)
1 #include<stdio.h>
2
3 int choose(int n, int k){
4 if ((n == k) || (k == 0))
5 return 1;
6 else
7 return (choose(n-1,k-1) +
choose(n-1,k));
8 }
9
10 int main(){
11 int n,k;
12 scanf("%d",&n);
13 scanf("%d",&k);
14 printf("%d\n",choose(n,k));
15 return 0;
16 }

Recursion in C
Recursion in C
1 #include<stdio.h>
2 Notethat to obtain the value
3 int choose(int n, int k){ of kn , two recursive calls
4 if ((n == k) || (k == 0))
5 return 1;
needto be made one to
n1 n1
6 else k1 and one to k .
7 return (choose(n-1,k-1) +
choose(n-1,k));
8 }
9
10 int main(){
11 int n,k;
12 scanf("%d",&n);
13 scanf("%d",&k);
15 return 0;
16 }

Recursion in C
Recursion in C
1 #include<stdio.h>
4 if ((n == k) || (k == 0))
5 return 1;
n1 n1
7 return (choose(n-1,k-1) + Known as double recursion.
choose(n-1,k));
8 }
9
10 int main(){
11 int n,k;
12 scanf("%d",&n);
13 scanf("%d",&k);
15 return 0;
16 }

Recursion in C
Recursion in C
1 #include<stdio.h>
4 if ((n == k) || (k == 0))
5 return 1;
n1 n1
choose(n-1,k));
8 } How many calls to the
9 function choose is made when
10 int main(){ n=6 and k=3?
11 int n,k;
12 scanf("%d",&n);
13 scanf("%d",&k);
15 return 0;
16 }

Recursion in C
Recursion in C
1 #include<stdio.h>
4 if ((n == k) || (k == 0))
5 return 1;
n1 n1
choose(n-1,k));
8 } How many calls to the
9 function choose is made when
10 int main(){ n=6 and k=3?
11 int n,k;
12 scanf("%d",&n); 37 calls!
13 scanf("%d",&k); No. of calls grow very fast
15 return 0;
(exponentially) with
16 } increasing values of n and k.

Recursion in C
Recursion in C
Example n choose k (Function Call Tree)
A Tree Structure representing the function call choose(5,2)

Recursion in C
Recursion in C
Example n choose k (Function Call Tree)
A Tree Structure representing the function call choose(5,2)

(5,2)
(4,1) (4,2)
(3,0) (3,1)
(3,1) (3,2)
1 (2,0) (2,1)
(2,0) (2,1) (2,1) (2,2)
1 (1,0) (1,1)
1 (1,0) (1,1) (1,0) (1,1) 1
1 1
1 1 1 1

Recursion in C
Recursion in C
Example n choose k (Order of Execution)
For n = 4 and k = 2.

Recursion in C
Recursion in C
choose(4,2) = choose(3,1) + choose(3,2)

Recursion in C
Recursion in C
= choose(2,0) + choose(2,1) + choose(3,2)

Recursion in C
Recursion in C
= choose(2,0)+ choose(2,1) + choose(3,2)
= 1 + choose(2,1) + choose(3,2)

Recursion in C
Recursion in C
= 1+ choose(2,1) + choose(3,2)
= 1+ choose(1,0) + choose(1,1) + choose(3,2)
= 1+ 1 + choose(1,1) + choose(3,2)
= 1+ 1 + 1 + choose(3,2)
= 1+ 1 + 1 + choose(2,1) + choose(2,2)
= 1+ 1 + 1 + choose(1,0) + choose(1,1)
+ choose(2,2)
= 1 + 1 + 1 + 1 + choose(1,1) + choose(2,2)

Recursion in C
Recursion in C
= 1+ 1 + choose(1,1) + choose(3,2)
= 1+ 1 + 1 + choose(3,2)
= 1+ 1 + 1 + choose(2,1) + choose(2,2)
= 1+ 1 + 1 + choose(1,0) + choose(1,1)
+ choose(2,2)
= 1 + 1 + 1 + 1 + choose(1,1) + choose(2,2)
= 1 + 1 + 1 + 1 + 1 + choose(2,2)

Recursion in C
Recursion in C
= 1+ 1 + choose(1,1) + choose(3,2)
= 1+ 1 + 1 + choose(3,2)
= 1+ 1 + 1 + choose(2,1) + choose(2,2)
= 1+ 1 + 1 + choose(1,0) + choose(1,1)
+ choose(2,2)
= 1 + 1 + 1 + 1 + choose(1,1) + choose(2,2)
= 1 + 1 + 1 + 1 + 1 + choose(2,2)
= 1+1+1+1+1+1

Recursion in C
Recursion in C
= 1+ 1 + choose(1,1) + choose(3,2)
= 1+ 1 + 1 + choose(3,2)
= 1+ 1 + 1 + choose(2,1) + choose(2,2)
= 1+ 1 + 1 + choose(1,0) + choose(1,1)
+ choose(2,2)
= 1 + 1 + 1 + 1 + choose(1,1) + choose(2,2)
= 1 + 1 + 1 + 1 + 1 + choose(2,2)
= 1+1+1+1+1+1
= 6

Recursion in C
Recursion in C
Advantages and Disadvantages
Advantages

Recursion in C
Recursion in C
Advantages
- Elegant. Solution is cleaner.

Recursion in C
Recursion in C
Advantages
- Fewer variables.

Recursion in C
Recursion in C
Advantages
- Fewer variables.
- Once the recursive definition is figured out, program is easy to
implement.
Disadvantages

Recursion in C
Recursion in C
Advantages
- Fewer variables.
implement.
Disadvantages
- Debugging can be considerably more difficult.

Recursion in C
Recursion in C
Advantages
- Fewer variables.
implement.
Disadvantages
- Figuring out the logic of the recursive function is not easy
sometimes.

Recursion in C
Recursion in C
Advantages
- Fewer variables.
implement.
Disadvantages
- Figuring out the logic of the recursive function is not easy
sometimes.
- In general, can be inefficient (requires more time and space).

Recursion in C
Example Reversing a String

String Reverse
Recursive Definition:
- reverse(aw)= reverse(w)a
- where w is a string and a is a single character.
Base Case:
- reverse(w)= w
- when w is the empty string (string of length 0).

Recursion in C
Example Reversing a String

Program
1 #include <stdio.h>
2 void reverse(){
3 char c;
4 scanf("%c",&c);
5 if( c != \n){
6 reverse();
7 printf("%c",c);
8 }
9 }
10
11 int main(){
12 reverse();
13 printf("\n");
14 return 0;
15 }

Recursion in C
Recap

Recursion in C
Recap
What is recursion?

Recursion in C
Recap
What is recursion?
Two components:

Recursion in C
Recap
What is recursion?
Two components:
- recursive definition, and

Recursion in C
Recap
What is recursion?
Two components:
- base case.

Recursion in C
Recap
What is recursion?
Two components:
- base case.
Function stack.

Recursion in C
Recap
What is recursion?
Two components:
- base case.
Function stack.
Advantages and disadvantages.

Recursion in C
Finding Maximum Element in an Array

Iterative Solution
Write a function that takes an integer array and the size of

the array as argument and returns the maximum element.

Recursion in C

Iterative Solution

1 int iterative_max(int *ar, int n)

{
2 int i, max = ar[0];
3 for (i=1; i<n; i++){
4 if (max < ar[i])
5 max = ar[i];
6 }
7 return max;
8 }

Recursion in C

Iterative Solution


{
2 int i, max = ar[0]; - Number of steps: n-1.
3 for (i=1; i<n; i++){
4 if (max < ar[i])
5 max = ar[i];
6 }
7 return max;
8 }

Recursion in C

Iterative Solution


{
2 int i, max = ar[0]; - Number of steps: n-1.
3 for (i=1; i<n; i++){
4 if (max < ar[i]) - Space used: 2 integer
5 max = ar[i]; variables (ar and n were part
6 } of the input).
7 return max;
8 }

Recursion in C

Recursive Solution I (Definition and Program)

Recursion in C

- r max1({a0 , a1 , . . . , an1 }, n) = max(a0 , r max1({a1 , . . . , an1 }, n 1))

Recursion in C

- r max1({a0 }, 1) = a0

Recursion in C

- r max1({a0 }, 1) = a0
1 int r_max1(int *ar, int n){

2 if (n==1) return *ar;
3 else return max(*ar,r_max1(ar+1,n-1));
4 }
5
6 int max(int a, int b){
7 if (a>b) return a;
8 else return b;
9 }

Recursion in C

Recursive Solution I (Function Stack)

3 else return max(*ar,r_max1(
ar+1,n-1));
4 }
5
8 else return b;
9 }

Recursion in C

ar 48 7 5 11 7
Addresses 48 52 56 60
ar+1,n-1));
4 }
5
8 else return b;
9 }
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
4 }
5
8 else return b;
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
4 }
5
7 if (a>b) return a; 52 3
8 else return b; r max1(52,3)
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
4 }
5
56 2
r max1(56,2)
6 int max(int a, int b){ ar n
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
3 else return max(*ar,r_max1( 60 1
r max1(60,1)
ar+1,n-1)); ar n
4 }
5
56 2
r max1(56,2)
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
2 if (n==1) return *ar; Return Values
r max1(60,1)
ar+1,n-1)); ar n
4 }
5
56 2
r max1(56,2)
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
r max1(60,1) 7
ar n
4 }
5
56 2
r max1(56,2)
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
r max1(60,1) 7
ar n
4 }
5
56 2
r max1(56,2) 11
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
r max1(60,1) 7
ar n
4 }
5
56 2
r max1(56,2) 11
8 else return b; r max1(52,3) 11
ar n
9 }
48 4
r max1(48,4)
ar n
Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
r max1(60,1) 7
ar n
4 }
5
56 2
r max1(56,2) 11
ar n
9 }
48 4
r max1(48,4) 11
ar n

Recursion in C

ar 48 7 5 11 7
ar+1,n-1));
r max1(60,1) 7
ar n
4 }
5
56 2
r max1(56,2) 11
ar n
9 }
48 4
r max1(48,4) 11
ar n
Note that the function r_max1 makes one call to itself in the
function definition.
Time is about n and space is equivalent to stack depth (which
is n).
Recursion in C

Recursive Solution II (Definition)

Recursion in C

If array size is 1, return the element.

Recursion in C


Otherwise, divide the array into two halves.

Recursion in C


Compute maximum of both the halves.

Recursion in C


Return maximum of these two values.

Recursion in C


- r max2({a0 , a1 , . . . , an1 }, n) =
max(r max2({a0 , . . . , an/21 }, n/2), r max2({an/2 , . . . , an1 }, (n + 1)/2))

Recursion in C


- r max2({a0 , a1 , . . . , an1 }, n) =
max(r max2({a0 , . . . , an/21 }, n/2), r max2({an/2 , . . . , an1 }, (n + 1)/2))
- r max2({a0 }, 1) = a0

Recursion in C

Recursive Solution II (Program)

3 else return b;
4 }
7 else return max(r_max2(ar,n
/2),r_max2(ar+(n/2),(n
+1)/2));
8 }

Recursion in C


3 else return b;
4 }
/2),r_max2(ar+(n/2),(n
+1)/2));
8 }
The function r_max2

makes two calls to itself
in the function definition.

Recursion in C

ar 48 7 5 11 7
3 else return b;
4 }
/2),r_max2(ar+(n/2),(n
+1)/2));
8 }
The function r_max2


Recursion in C

ar 48 7 5 11 7
2 if (a>b) return a; Function Call Tree to r_max2 for
3 else return b; the above array.
4 }
/2),r_max2(ar+(n/2),(n
+1)/2));
8 }
The function r_max2


Recursion in C

ar 48 7 5 11 7
4 } (48,4)
7 else return max(r_max2(ar,n (48,2) (56,2)
/2),r_max2(ar+(n/2),(n
+1)/2));
(48,1) (52,1) (56,1) (60,1)
8 }
The function r_max2


Recursion in C

ar 48 7 5 11 7
4 } (48,4)
/2),r_max2(ar+(n/2),(n
+1)/2));
(48,1) (52,1) (56,1) (60,1)
8 }
- Number of function calls:
The function r_max2 2n-1
makes two calls to itself (constant time per call).

Recursion in C

ar 48 7 5 11 7
4 } (48,4)
/2),r_max2(ar+(n/2),(n
+1)/2));
(48,1) (52,1) (56,1) (60,1)
8 }
- Number of function calls:
The function r_max2 2n-1
makes two calls to itself (constant time per call).
in the function definition. - Stack Depth: log (n)
(space used).
Recursion in C
Searching an Element in an Array

Recursion in C

How do we search for an element in an array?

Recursion in C

- Check if the element is present in each cell of the array.

Recursion in C

How many steps does the above algorithm take?

Recursion in C

- About n (where n is the size of the array).

Recursion in C

Now, suppose the array is sorted (say in increasing order)?

Recursion in C

Can you do better than n?

Recursion in C

We will use the fact that the array is sorted, to discard some
comparisons (in fact many).

Recursion in C

Idea (Binary Search):

Recursion in C

- Let ar be the given array of size n, and we want to search for
the element elt in ar.

Recursion in C

- We check if elt is the middle element in ar.

Recursion in C

- If yes, we are done. Otherwise, if elt is smaller, what can we
say?

Recursion in C

say?
- elt must be present in the first half of the array!

Recursion in C

say?
- elt must be present in the first half of the array!
- Hence after one comparison we have eliminated one half of the
array.
Recursion in C
Binary Search
Example
Consider the following array: {2,4,5,7,10,11,15,20,25,30,35}

Suppose we want to search for the element 17 in the array.

Recursion in C
Binary Search
Example

- Compare 17 with the middle element, 11.
2 4 5 7 10 11 15 20 25 30 35

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
- Consider the 2nd half since 17 is greater.
2 4 5 7 10 11 15 20 25 30 35

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35
- Consider the 1st half since 17 is smaller.
15 20 25 30 35

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35
15 20 25 30 35
15 20

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35
15 20 25 30 35
15 20
15 20

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35
15 20 25 30 35
15 20
15 20
- Compare 17 with the 20.
20

Recursion in C
Binary Search
Example

2 4 5 7 10 11 15 20 25 30 35
2 4 5 7 10 11 15 20 25 30 35
15 20 25 30 35
15 20 25 30 35
15 20
15 20
- Compare 17 with the 20.
20
- 17 is not present.
Recursion in C
Binary Search
Program
Recursive Implementation of Binary Search

The function binary_search takes the following arguments:
- ar: array, l: start index, u: end index, and elt: element to be searched
If elt is present, returns the index at which elt is present, otherwise returns
-1.

Recursion in C
Binary Search
Program
Recursive Implementation of Binary Search

The function binary_search takes the following arguments:
- ar: array, l: start index, u: end index, and elt: element to be searched
If elt is present, returns the index at which elt is present, otherwise returns
-1.
1 int binary_search(int *ar, int l, int u, int elt){

2 if (l>u) return -1;
3 else{
4 if (ar[(l+u)/2] == elt) return (l+u)/2;
5 else if (ar[(l+u)/2] > elt) return binary_search(ar, l, (l+u)
/2 - 1, elt);
6 else return binary_search(ar, (l+u)/2 + 1, u, elt);
7 }
8 }

Recursion in C
Binary Search
Analysis

Recursion in C
Binary Search
Analysis
Number of function calls: log(n) +1 (in the worst case).

Recursion in C
Binary Search
Analysis

Time taken: log(n)+1

Recursion in C
Binary Search
Analysis

Stack Depth: log (n) +1.

Recursion in C
Binary Search
Analysis

Stack Depth: log (n) +1.
Only works if the array is sorted in ascending or descending
order.

Recursion in C
Announcements

Recursion in C
Announcements
Practice Problems for upcoming Lab Exam on the

Programming Gym
http://www2.cse.iitk.ac.in:81/newonj/contests.php?contestID=17
Time yourself to 4 hours and take the contest.

Recursion in C
Announcements

Programming Gym
Students who scored 40/50 in the previous contest:
- Prawal Gangwar, Amit Kumar, Nishant Rai, Lakshay
Garg, Divyank Aggarwal and Sarthak Garg
- Several students also scored 30 out 50.
- Congratulations to all!

Recursion in C
Announcements

Programming Gym
Students who scored 40/50 in the previous contest:
- Prawal Gangwar, Amit Kumar, Nishant Rai, Lakshay
Garg, Divyank Aggarwal and Sarthak Garg
- Several students also scored 30 out 50.
- Congratulations to all!
Students who got 100/100 in Lab Exam 1:
- Prakhar Kulshreshtha, Satyam Dwivedi and Lakshay Garg
- Congratulations and well done!

Recursion in C
Global Variables

Recursion in C
Global Variables
Variables declared outside every

function definition (after the
#include statements).

Recursion in C
Global Variables

Can be accessed by all functions

in the program.

Recursion in C
Global Variables


in the program.
1 #include<stdio.h>
2 int g=10, h=20;
3
4 int add(){
5 return g+h;
6 }
7
8 int main(){
9 printf("%d %d %d\n",g,h,add());
10 return 0;
11 }
10 20 30
Recursion in C
Global Variables


in the program.
1 #include<stdio.h>
2 int g=10, h=20;
3
4 int add(){
5 return g+h;
6 }
7
8 int main(){
10 return 0;
11 }
Output: 10 20 30
Recursion in C
Global Variables
What if a variable is declared

inside a function that has the
same name as a global variable?

in the program.
1 #include<stdio.h>
2 int g=10, h=20;
3
4 int add(){
5 return g+h;
6 }
7
8 int main(){
10 return 0;
11 }
Output: 10 20 30
Recursion in C
Global Variables

The global variable is
shadowed inside that
in the program.
particular function only.
1 #include<stdio.h>
2 int g=10, h=20;
3
4 int add(){
5 return g+h;
6 }
7
8 int main(){
10 return 0;
11 }
Output: 10 20 30
Recursion in C
Global Variables

in the program.
1 #include<stdio.h>
2 int g=10, h=20; 1 #include<stdio.h>
3 2 int g=10;
4 int add(){ 3 void fun1(){
5 return g+h; 4 int g=20;
6 } 5 printf("%d\n",g);
7 6 } 10
8 int main(){ 7 int main(){ 20
9 printf("%d %d %d\n",g,h,add()); 8 printf("%d\n",g); 10
10 return 0; 9 fun1();
11 } 10 printf("%d\n",g);
11 return 0;
12 }
Output: 10 20 30
Recursion in C
Global Variables

in the program.
1 #include<stdio.h>
2 int g=10, h=20; 1 #include<stdio.h>
3 2 int g=10;
4 int add(){ 3 void fun1(){
5 return g+h; 4 int g=20; Output:
6 } 5 printf("%d\n",g);
7 6 } 10
8 int main(){ 7 int main(){ 20
9 printf("%d %d %d\n",g,h,add()); 8 printf("%d\n",g); 10
10 return 0; 9 fun1();
11 } 10 printf("%d\n",g);
11 return 0;
12 }
Output: 10 20 30
Recursion in C
Counting Function Calls

Example - Fibonacci Numbers
F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

Recursion in C

F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

We will use a global variable to count the number of recursive
calls made in computing the n-th Fibonacci number.

Recursion in C

F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

1 #include<stdio.h>
2 int count = 0;
3
4 int fib(int n){ Output:
5 count = count+1;
6 if (n==1 || n==2) return 1;
7 else return fib(n-1) + fib(n-2);
8 }
9
10 int main(){
11 int num;
12 scanf("%d",&num);
13 printf("%d, %d\n",fib(num),count);
14 return 0;
15 }

Recursion in C

F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

1 #include<stdio.h>
2 int count = 0;
3
5 count = count+1;
6 if (n==1 || n==2) return 1;
Value of num Output
7 else return fib(n-1) + fib(n-2);
8 }
9
10 int main(){
11 int num;
14 return 0;
15 }

Recursion in C

F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

1 #include<stdio.h>
2 int count = 0;
3
5 count = count+1;
6 if (n==1 || n==2) return 1;
Value of num Output
7 else return fib(n-1) + fib(n-2); 3 2, 3
8 }
9
10 int main(){
11 int num;
14 return 0;
15 }

Recursion in C

F (n) = F (n 1) + F (n 2) and F (1) = F (2) = 1.

1 #include<stdio.h>
2 int count = 0;
3
5 count = count+1;
6 if (n==1 || n==2) return 1;
Value of num Output
7 else return fib(n-1) + fib(n-2); 3 2, 3
8 }
9 10 55, 109
10 int main(){ 20 6765, 13529
11 int num;
12 scanf("%d",&num); 30 832040, 1664079
14 return 0;
15 }

Recursion in C
Return of the Sorting Problem

Recursive Approach

Recursion in C

Recursive Approach
We have seen the Selection Sort algorithm for sorting an array.

Recursion in C

Recursive Approach

Let us try to devise a recursive approach.
Recursive Approach:

Recursion in C

Recursive Approach

Recursive Approach:
- Divide the array into two halves.

Recursion in C

Recursive Approach

Recursive Approach:
Thats easy!

Recursion in C

Recursive Approach

Recursive Approach:
Thats easy!
- Sort them recursively.

Recursion in C

Recursive Approach

Recursive Approach:
Thats easy!
- Merge the two sorted sub arrays.

Recursion in C

Recursive Approach

Recursive Approach:
Thats easy!
- Merge the two sorted sub arrays.
How do we merge two sorted arrays?

Recursion in C
Sorting an Array
Merging Two Sorted Arrays First Approach
Solution Idea:

Recursion in C
Sorting an Array
Solution Idea:
- Let A and B be the two sorted arrays.

Recursion in C
Sorting an Array
Solution Idea:
- For every element in array B, check where it would fit in array
A by scanning from left to right.

Recursion in C
Sorting an Array
Solution Idea:
Example: Consider 2 sorted arrays A = {1, 2, 7, 9} and
B = {3, 5, 11}.

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
First 3 is inserted: {1, 2, 3, 7, 9}

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}
Finally 11 is inserted: {1, 2, 3, 5, 7, 9, 11}

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}
If A has size n and B has size m, how many steps will this
algorithm take in the worst case

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}
- Number of steps n + n + . . . (m times) = n m. (Verify
yourself!)

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}
yourself!)
Now suppose A and B are halves of an array of size n (both
have size n/2).

Recursion in C
Sorting an Array
Solution Idea:
B = {3, 5, 11}.
Then 5 is inserted: {1, 2, 3, 5, 7, 9}
yourself!)
have size n/2).
Number of steps = n2 /4.
Recursion in C
Sorting an Array
Merging Two Sorted Arrays Second Approach (Example)
Let A = {1, 2, 7, 9} and B = {3, 8, 11, 14} be two sorted arrays.

A 1 2 7 9 B 3 8 11 14 C

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9 11

Recursion in C
Sorting an Array

A 1 2 7 9 B 3 8 11 14 C
A 1 2 7 9 B 3 8 11 14 C 1
A 1 2 7 9 B 3 8 11 14 C 1 2
A 1 2 7 9 B 3 8 11 14 C 1 2 3
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9 11
A 1 2 7 9 B 3 8 11 14 C 1 2 3 7 8 9 11 14

Recursion in C
Sorting an Array
Merging Two Sorted Arrays Second Approach (Algorithm)
1 Input: Array A of size n and array B of size m.

Recursion in C
Sorting an Array

2 Create an empty array C of size n + m.

Recursion in C
Sorting an Array

3 Variables i, j and k are the array variables for the arrays A, B
and C respectively

Recursion in C
Sorting an Array

and C respectively
4 At each iteration, compare the i-th element of A (say u) with
the j-th element of B (say v )

Recursion in C
Sorting an Array

and C respectively
- if u is smaller, copy u to C; increment i and k,

Recursion in C
Sorting an Array

and C respectively
- otherwise, copy v to C; increment j and k,

Recursion in C
Sorting an Array

and C respectively
Number of steps 3(n + m).
- The constant 3 is not very important as it does not vary with
different sized arrays.

Recursion in C
Sorting an Array

and C respectively
have size n/2).

Recursion in C
Sorting an Array

and C respectively
have size n/2).
Number of steps = 3n.

Recursion in C
Sorting an Array

and C respectively
have size n/2).
Number of steps = 3n.
Much smaller than n2 /4 for large values of n.
Recursion in C
Sorting an Array
Merge Sort Complete Algorithm
MergeSort(A[0, . . . , n 1], n)

Recursion in C
Sorting an Array
MergeSort(A[0, . . . , n 1], n)
1 If n > 1,
1 MergeSort(A[0, . . . , n/2 1], n/2)
2 MergeSort(A[n/2, . . . , n 1], n n/2)

Recursion in C
Sorting an Array
MergeSort(A[0, . . . , n 1], n)
1 If n > 1,
1 MergeSort(A[0, . . . , n/2 1], n/2)
2 MergeSort(A[n/2, . . . , n 1], n n/2)
3 Merge(A, n)

Recursion in C
Sorting an Array
MergeSort(A[0, . . . , n 1], n)
1 If n > 1,
1 MergeSort(A[0, . . . , n/2 1], n/2)
2 MergeSort(A[n/2, . . . , n 1], n n/2)
3 Merge(A, n)
Description of the functions
MergeSort: Takes an array A of size n and sorts it

Recursion in C
Sorting an Array
MergeSort(A[0, . . . , n 1], n)
1 If n > 1,
1 MergeSort(A[0, . . . , n/2 1], n/2)
2 MergeSort(A[n/2, . . . , n 1], n n/2)
3 Merge(A, n)
Description of the functions
MergeSort: Takes an array A of size n and sorts it
Merge: Takes an array A of size n with the assumption that
the first n/2 elements and the remaining n n/2 elements are
sorted. Merges the two arrays and puts it back in A.

Recursion in C
Sorting an Array
Merge Sort C Code
1 void merge(int *ar, int n){
2 int *temp, i, j=0, k=n/2;
3 temp = (int *)malloc(sizeof(int)*n);
4 for(i=0; i<n; i++){
5 if ((j < n/2) && (k < n)){
6 if (ar[j] < ar[k]){
7 temp[i] = ar[j];
8 j++; }
9 else{
10 temp[i] = ar[k];
11 k++; }
12 }
13 else if (j == n/2){
14 temp[i] = ar[k];
15 k++; }
16 else{
17 temp[i] = ar[j];
18 j++; }
19 }
20 for (i=0; i<n; i++)
21 ar[i] = temp[i];
22 free(temp);}
Recursion in C
Sorting an Array
Merge Sort C Code
4 for(i=0; i<n; i++){ 1 void merge_sort(int *ar, int n){
5 if ((j < n/2) && (k < n)){ 2 if (n>1){
6 if (ar[j] < ar[k]){ 3 merge_sort(ar,n/2);
7 temp[i] = ar[j]; 4 merge_sort(ar+(n/2), n-(n/2));
8 j++; } 5 merge(ar,n);
9 else{ 6 }
10 temp[i] = ar[k]; 7 }
11 k++; } 8
12 } 9 int main(){
13 else if (j == n/2){ 10 int ar1[]={2,5,4,8,6,9,8,6,1,4,7};
14 temp[i] = ar[k]; 11 merge_sort(ar1,11);
15 k++; } 12 display(ar1,11); //displaying array
16 else{ 13 return 0;
17 temp[i] = ar[j]; 14 }
18 j++; }
19 }
20 for (i=0; i<n; i++) 1 2 4 4 5 6 6 7 8 8 9
21 ar[i] = temp[i];
22 free(temp);}
Recursion in C
Sorting an Array
Merge Sort C Code
4 for(i=0; i<n; i++){ 1 void merge_sort(int *ar, int n){
5 if ((j < n/2) && (k < n)){ 2 if (n>1){
6 if (ar[j] < ar[k]){ 3 merge_sort(ar,n/2);
7 temp[i] = ar[j]; 4 merge_sort(ar+(n/2), n-(n/2));
8 j++; } 5 merge(ar,n);
9 else{ 6 }
10 temp[i] = ar[k]; 7 }
11 k++; } 8
12 } 9 int main(){
13 else if (j == n/2){ 10 int ar1[]={2,5,4,8,6,9,8,6,1,4,7};
14 temp[i] = ar[k]; 11 merge_sort(ar1,11);
15 k++; } 12 display(ar1,11); //displaying array
16 else{ 13 return 0;
17 temp[i] = ar[j]; 14 }
18 j++; }
19 }
20 for (i=0; i<n; i++) Output: 1 2 4 4 5 6 6 7 8 8 9
21 ar[i] = temp[i];
22 free(temp);}
Recursion in C
Sorting an Array
Merge Sort Time Analysis (the best part)

Recursion in C
Sorting an Array
For the sake of simplicity lets assume n = 2k for some k. (In

general, n need not be a power of 2, but the analysis does not
change much.)

Recursion in C
Sorting an Array

change much.)
Function Call Tree
n=8
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
Let T (n) be the time taken by
MergeSort on an array of size n. Then,
n=8
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
n=8
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
= 23 T (n/8) + 12n
2 2 2 2
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
= 23 T (n/8) + 12n
2 2 2 2
= 2k T (n/2k ) + k 4n
1 1 1 1 1 1 1 1

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
= 23 T (n/8) + 12n
2 2 2 2
= 2k T (n/2k ) + k 4n
1 1 1 1 1 1 1 1 = n T (1) + log2 n 4n

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
= 23 T (n/8) + 12n
2 2 2 2
= 2k T (n/2k ) + k 4n
1 1 1 1 1 1 1 1 = n T (1) + log2 n 4n
5n log2 n

Recursion in C
Sorting an Array

change much.)
Function Call Tree
T (n) = 2T (n/2) + 4n
= 2(2T (n/4) + 4(n/2)) + 4n
n=8
= 22 T (n/4) + 8n
= 22 (2T (n/8) + 4(n/4)) + 8n
4 4
= 23 T (n/8) + 12n
2 2 2 2
= 2k T (n/2k ) + k 4n
1 1 1 1 1 1 1 1 = n T (1) + log2 n 4n
5n log2 n
Recall that time take by selection sort was n(n 1)/2.

ESc101 S 10 Recursion

Diunggah oleh

Informasi Dokumen

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

ESc101 S 10 Recursion

Diunggah oleh

Hak Cipta:

Format Tersedia

Recursion in C

Fundamentals of Computing (ESc 101A)

Indian Institute of Technology, Kanpur

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

1 #include<stdio.h> The function fact takes an

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

1 #include<stdio.h> The function fact takes an

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

1 #include<stdio.h> The function fact takes an

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

1 #include<stdio.h> The function fact takes an

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

1 #include<stdio.h> The function fact takes an

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Whenever a call is made to a

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Whenever a call is made to a

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Whenever a call is made to a

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Whenever a call is made to a

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Whenever a call is made to a

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Whenever a call is made to a

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Whenever a call is made to a 2

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Order of Execution: fact(3) = 3*fact(2)= 3*(2*fact(1))=

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Binomial Coefficient (n choose k)

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Binomial Coefficient (n choose k)

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Binomial Coefficient (n choose k)

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

A Tree Structure representing the function call choose(5,2)

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

A Tree Structure representing the function call choose(5,2)

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Raghunath Tewari rtewari@cse.iitk.ac.in ESc101A

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=

Order of Execution: fact(3) = 3fact(2)= 3(2*fact(1))=