Gate Sample Question

Question

#include<stdio.h>
void crazy(int n, int a, int b)
{
if (n ≤ 0) return;
crazy(n-1, a, b + n);
printf("%d %d %d\n", n, a, b);
crazy(n-1, b, a + n);
}
int main()
{
crazy(3, 4, 5);
5
return 0;
}

 

(a) 1 4 10    (b) 3 4 5                              
2 4 8            1 4 10
1 8 6             2 4 8
3 4 5             1 8 6
1 5 9             1 5 9
2 5 7             2 5 7
1 7 7              1 7 7

 

(c) 1 4 10     (d) 3 4 5
2 4 8            1 5 9
1 8 6            2 5 7
3 4 5            1 7 7

 

 

 

 

 

please need solution with explaination

Comments

Please avoid "gate sample questions" while creating tags.

Answer 1

becoz it is a non tail recursion(after the function call there is something to do),so used recursion tree

Answer 2

by using recursion tree method while traverse DFS Left to right.