Are you taking CLEP classes? Try clep.ai
| preferred AP College board partner for AP classes
AP Computer Science A/Unit 10: Recursion
Start Practice TestPractice Test
About Exam
medium Solved by 2 students

Binary Recursion Time Complexity

Mark
< Prev
Next >

What is the time complexity of the doubleRecursion method shown below?

public void doubleRecursion(int n) {
    if(n <= 0) return;
    doubleRecursion(n - 1);
    doubleRecursion(n - 1);
}
A

O(n)

B

O(2^n)

C

O(n!)

D

O(n^2)

Hint
Did You Know?
Explain Why
Explain All Answers
Check Answer
Show Correct Answer
Report Question

Question Leaderboard

Not enough data yet to show leaderboard.

AI Tutor

How can I help?

APFIVE © 2020.
Email: apfive@apfive.org|Privacy Policy|