What output is generated by calling 'print_rev(4)'?
#include <stdio.h>
void print_rev(int n) {
if (n == 0) return;
printf("%d ", n);
print_rev(n - 1);
}Printing occurs before the recursive call, outputting values in descending order: 4 3 2 1.
What does the following recursive function return for 'gcd(48, 18)'?
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}Euclidean algorithm: gcd(48, 18) -> gcd(18, 12) -> gcd(12, 6) -> gcd(6, 0) = 6.
What is the maximum number of activation records on the stack for 'fib(4)' with naive recursion?
Max depth of recursion stack for fib(4) equals 5 activation frames at peak depth.
What will be printed by 'main()' when executing this code?
#include <stdio.h>
int fun(int n) {
if (n == 1) return 1;
if (n % 2 == 0) return fun(n / 2);
else return fun(3 * n + 1);
}
int main(void) {
printf("%d", fun(6));
return 0;
}Collatz sequence for 6: 6 -> 3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1. Eventually reaches base case returning 1.
What is the output of the following C loop?
#include <stdio.h>
int main(void) {
int i = 0;
for (; i < 5; i++) {
if (i == 3) break;
}
printf("%d", i);
return 0;
}When i reaches 3, the break statement terminates the loop immediately, printing 3.