Euclid's algorithm:
- Acheck_circle
gcd(a, 0) = a; gcd(a, b) = gcd(b, a % b);
- B
gcd(a, b) = a + b
- C
gcd(a, b) = 1 always
- D
gcd(a, b) = max(a, b)
Explanation
Iterates remainder; very efficient: O(log min(a,b)).
Recursion
AP Computer Science A· difficulty 4/5
Want 10 more like this — adaptive to your weak spots?
Related questions
- csa-rec-006
Naive recursive Fibonacci <codefib(n) = fib(n-1) + fib(n-2)</code has time complexity…
chevron_right - csa-rec-026
Mutual recursion is when…
chevron_right - csa-hard3-014
Consider: <code class="language-java"public static int h(int a, int b) { if (a <= 0) return b; if (b <= 0) return a; return h(a - b, b + 1); } </code</pre What …
chevron_right