Quiz on Complexity analysis for DSA: Question 8

Last Updated :
Discuss
Comments

Determine the time complexity for the following recursive function :

C++ 
int recursive(n) {     if (n <= 1) return 1;     else      {         return recursive(n - 1) + recursive(n - 1);     }      }
C 
int recursive(n) {     if (n <= 1) return 1;     else      {         return recursive(n - 1) + recursive(n - 1);     }      }
Java 
public static int recursive(int n) {         if (n <= 1) {             return 1;         } else {             return recursive(n - 1) + recursive(n - 1);         }     }
Python 
def recursive(n):     if n <= 1:         return 1     else:         return recursive(n - 1) + recursive(n - 1)
JavaScript 
function recursive(n) {     if (n <= 1) {         return 1;     } else {         return recursive(n - 1) + recursive(n - 1);     } }


O(n)

O(log n)

O(2^n)

O(n^2)

This question is part of this quiz :

Quiz on Complexity analysis for DSA
Tags:
DSA
Share your thoughts in the comments
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