Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Визначити складність алгоритму
int f1(int n){
if (n<=1) return(1);
else return(f1(n-1)+f1(n-1));
}
Θ(n2)
Θ(n)
Θ(log n)
Θ(n3)
Θ(n log n)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!