Recursion_DS

void printNumbers(int n) {

if (n <= 0) {

return;

}

printNumbers(n - 1);

cout << n << " ";

}

int main() {

printNumbers(5);

return 0;

}

• 5 4 3 2 1

• 1 2 3 4 5

• 1 1 1 1 1

• 5 5 5 5 5

void printNumbers(int n) {

if (n <= 0) {

return;

}

cout << n << " ";

printNumbers(n - 1);

}

int main() {

printNumbers(5);

return 0;

}

• 5 4 3 2 1

• 1 2 3 4 5

• 1 1 1 1 1

• 5 5 5 5 5

int mystery(int n) {

if (n <= 0) {

return 0;

}

return (n % 10) + mystery(n / 10);

}

int main() {

cout << mystery(12345) << endl;

return 0;

}

• 15

• 10

• 14

• 9

Which of the following best describes the time complexity of a recursive algorithm with a recurrence relation of T(n) = T(n/2) + O(1)?

• O(n log n)

• O(n)

• O(log n)

• O(1)

Which of the following best describes the time complexity of a recursive algorithm with a recurrence relation of T(n) = T(n/2) + n?

• O(n log n)

• O(n)

• O(log n)

• O(1)

Which of the following best describes the time complexity of a recursive algorithm with a recurrence relation of T(n) = T(n-1) + O(1)?

• O(n log n)

• O(n)

• O(log n)

• O(1)

Which of the following best describes the time complexity of a recursive algorithm with a recurrence relation of T(n) = T(n-1) + n?

• O(n log n)

• O(n^2)

• O(log n)

• O(n)