| CARVIEW |
Select Language
HTTP/2 200
content-type: text/html; charset=utf-8
date: Sun, 24 Aug 2025 11:54:26 GMT
permissions-policy: interest-cohort=()
strict-transport-security: max-age=31536000; includeSubDomains
server: nginx
cache-control: s-maxage=60347, max-age=0
x-powered-by: Next.js
etag: "psxy3uouti9cq2"
content-encoding: gzip
x-xss-protection: 1; mode=block
x-content-type-options: nosniff
referrer-policy: no-referrer-when-downgrade
content-security-policy: default-src 'self' http: https: ws: wss: data: blob: 'unsafe-eval' 'unsafe-inline'; frame-ancestors 'self';
vary: Accept-Encoding
x-cache: Hit from cloudfront
via: 1.1 c78109ef0319a904f4e8ec6cf6a5a890.cloudfront.net (CloudFront)
x-amz-cf-pop: BOM78-P9
x-amz-cf-id: ff30eFPMvKVaLaOsRR5zeyhalxqtU0XobFeY5ukF2SxdZgS60qsXtg==
age: 26483
Quiz on Complexity analysis for DSA: Question 8 
C++
C
Java
Python
JavaScript
- Courses
- Tutorials
- Practice
- Jobs
Data Structure
Java
Python
HTML
Interview Preparation
Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
Quiz on Complexity analysis for DSA: Question 8
Last Updated :
Discuss
Comments
Determine the time complexity for the following recursive function :
int recursive(n)
{
if (n <= 1) return 1;
else
{
return recursive(n - 1) + recursive(n - 1);
}
}
int recursive(n)
{
if (n <= 1) return 1;
else
{
return recursive(n - 1) + recursive(n - 1);
}
}
public static int recursive(int n) {
if (n <= 1) {
return 1;
} else {
return recursive(n - 1) + recursive(n - 1);
}
}
def recursive(n):
if n <= 1:
return 1
else:
return recursive(n - 1) + recursive(n - 1)
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 DSATags:
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