What is the space complexity of a recursive binary search on an array of size N?
The maximum call stack depth for recursive binary search is O(log N).
What happens when an accumulator parameter is used in a recursive function?
Accumulators pass intermediate state forward, removing post-recursive computation.
What is printed by calling fun(100)?
void fun(int n) {
if (n <= 0) return;
fun(n - 25);
printf("%d ", n);
}fun(100)->fun(75)->fun(50)->fun(25)->fun(0). Unwinding prints: 25 50 75 100.
What is the output of the following C function for f(5)?
int f(int n) {
if (n == 0) return 0;
return n + f(n / 2);
}f(5) = 5 + f(2) = 5 + 2 + f(1) = 5 + 2 + 1 + f(0) = 8.
What is the output of the C function below when called as check(15, 20)?
int check(int a, int b) {
if (a == b) return a;
if (a > b) return check(a - b, b);
return check(a, b - a);
}This implements Euclidean subtraction for GCD of 15 and 20, which is 5.