Add to Chrome
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
What is the time complexity of the following?
void f(int n)
{
if (n>0)
cout<<n;
f(n-1);
}
Ѳ( n )
Ѳ(n log n)
Ѳ(2n)
Ѳ(log n)
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!