Recursion

AP Computer Science A· difficulty 3/5

Factorial: <code> int fact(int n) </code> =

A
$if (n <= 1) return 1; else return n * fact(n - 1);$
check_circle
B
$while (n > 1) ...$
C
$Both A and B work; A is recursive$
D
$for (int i = 1; i <= n; i++) ...$

Explanation

Classic recursion: base case n \leq 1; recursive call decreases n.

Want 10 more like this — adaptive to your weak spots?

Practice 10 like thisarrow_forward Predict my AP score

Related questions

csa-u910-067
What is printed?…
chevron_right
csa-u910-054
What is printed?…
chevron_right
csa-hard3-013
Consider: <code class="language-java"public static int g(int n, int acc) { if (n == 0) return acc; return g(n / 2, acc + n % 2); } </code</pre What does <codeg(…
chevron_right

auto_awesomeAll Tools question_answerHomework Q&A menu_bookAP & SAT Prep timelineLearn Mode

AP Computer Science A · Recursion Practice Question | Acemy