Recursion

Question

Find Output of below Code

#include<stdio.h>

int sum(int n) {
    n = 3;
  if (n == 2) return 2;
  return sum(n-1)*n ;
}

int main() {
    printf("%d\n", sum(5) );
    return 0

}

Answer 1

The invocations of function call will look like this :

 

 

After Invocation of Sum(5) it will keep on calling Sum(2) again and again. After sometime stack will be 

full and program will terminate abnormally without printing anything on the screen.