Question

4. For the following recursive function, findf (5): int f(int n) if (n 0) return 0; else return n f(n - 1);

algorithms & data structures-1

answer and explain briefly .

Answer 1

Answers:

5 o) elu e L4) elke 0; (30) 어efunn o; else ent f2) eue int f(o) e lbe un 1 2018-3-26 18:25

explanation:

first of all the f() is called from main() in function integer 5 is passed as an argument .
then f(5) is added to the result of f(5-1).
the next function call from f() to f() 4 is passed which is added to the result of f(3).
this process continues until n is equal to 0
when n is equal to 0 then it return to f(1) and f(1) return to the value to the f(2) and till f(5) we have to backtrack from it.

the codeing part of this question:

#include <stdio.h>

int fun(int n)
{
   if (n == 0)
   return 0;
   else
   return n+fun(n-1);
}

int main()
{
int n=5;
printf("%d ", fun(n));
return 0;
}

output:

15