APFIVE Binary Recursion Time Complexity
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(2^n)
B
O(n)
C
O(n!)
D
O(n^2)
Question Leaderboard
Not enough data yet to show leaderboard.