Time complexity of the code? int fun(int n, int m, int o) { if (n <= 0) printf("%d, %d\n",m, o); else { fun(n-1, m+1, o); fun(n-1, m, o+1); }

• Quadratic
• O (log n)
• O (n log m)
• Exponential

What is the time complexity of the following code? int fun(int x) { if (x <= 0) return 1; return 1 + fun(x-1); }

• O(n)
• O (log n)
• O (n log n)
• O (log log n)

What is the time complexity of the code? int fun(int x) { if (x <= 0) return 1; return 1 + fun(x/5); }

• O(n)
• O (log n)
• O (n log n)
• O (log log n)

int sumDigits(int n) { if (n == 0) return 0; else return n % 10 + sumDigits(n / 10); } int main() { printf("Sum of Digits: %d\n", sumDigits(123)); return 0; }

• 6
• 5
• 9
• 12

void show(int,int,int); int main() { int a = 1; show(++a, a++, a); return 0; } void show(int i, int j, int k) { printf("%d %d %d,\n", i, j, k); }

• 1 1 3
• 3 1 3
• 3 1 1
• 3 3 3

#include <stdio.h> int factorial(const int n) { if (n <= 1) return 1; else return n * factorial(n - 1); } int main() { printf("Factorial: %d\n", factorial(5)); return 0; }

• 200
• 100
• 120
• error

int mysteryFunction(int a, int b) { if (b == 0) return 1; else return a * mysteryFunction(a, b - 1); } int main() { printf("Mystery Function: %d\n", mysteryFunction(2, 3)); return 0; }

• 8
• 6
• 16
• 2

What does the following recursive function calculate? int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { printf("GCD: %d\n", gcd(24, 36)); return 0; }

• Greatest common divisor of a and b
• Least common multiple of a and b
• Exponential power of a with base b
• Factorial of a

int countEven(int n) { if (n == 0) return 0; else return 1 + countEven(n - 2); } int main() { printf("Count of Even Numbers: %d\n", countEven(10)); return 0; }

• 3
• 4
• 5
• 6

static int count = 0; void recursiveFunction() { if (count < 5) { printf("%d ", count); count++; recursiveFunction(); } } int main() { printf("Recursive Function: "); recursiveFunction(); printf("\n"); return 0; }

• 0 1 2 3 4
• 1 2 3 4 5
• 0 2 4 6 8
• 2 4 6 8 10