What is the return value of find_max(a, 5) for array {3, 9, 2, 8, 5}?
int find_max(int a[], int n) {
if (n == 1) return a[0];
int m = find_max(a, n - 1);
return (a[n-1] > m) ? a[n-1] : m;
}Recursively finds the maximum element in the array, which is 9.
What will be the output of the following C code?
#include <stdio.h>
int foo(int n) {
if (n <= 1) return 1;
return foo(n - 1) + foo(n - 2) + foo(n - 3);
}
int main(void) {
printf("%d", foo(3));
return 0;
}foo(3) = foo(2) + foo(1) + foo(0). foo(2) = foo(1)+foo(0)+foo(-1) = 1+1+1 = 3? Wait: foo(1)=1, foo(0)=1, foo(-1)=1 => foo(2) = 1+1+1 = 3. foo(3) = foo(2) [3] + foo(1) [1] + foo(0) [1] = 5.
What happens when a recursive call passes an incremented pointer ptr + 1?
Pointer arithmetic in argument expressions passes a new pointer value by value to the callee.
What is the return value of sum_arr(arr, 4) for array {10, 20, 30, 40}?
int sum_arr(int *p, int n) {
if (n <= 0) return 0;
return *p + sum_arr(p + 1, n - 1);
}Recursively sums all array elements: 10 + 20 + 30 + 40 = 100.
What is the output of the following program?
#include <stdio.h>
void print_bin(int n) {
if (n > 1) print_bin(n / 2);
printf("%d", n % 2);
}
int main(void) {
print_bin(10);
return 0;
}Binary representation of 10 is 1010_2.