- Courses
- Tutorials
- Practice
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Analysis of Algorithms | Question 19
Last Updated :
Discuss
Comments
Consider the following two functions. What are time complexities of the functions?
int fun1(int n)
{
if (n <= 1) return n;
return 2*fun1(n-1);
}
int fun2(int n)
{
if (n <= 1) return n;
return fun2(n-1) + fun2(n-1);
}
O(2^n) for both fun1() and fun2()
O(n) for fun1() and O(2^n) for fun2()
O(2^n) for fun1() and O(n) for fun2()
O(n) for both fun1() and fun2()
This question is part of this quiz :
Top MCQs on Complexity Analysis of Algorithms with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy