Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > The time complexity of the following C functi...
Start Learning for Free
The time complexity of the following C function
is (assume n > 0)
int recursive (int n)
{
if (n == 1)
return(1);
else
return(recursive(n- 1) + recursive(n - 1));
}
is (assume n > 0)
int recursive (int n)
{
if (n == 1)
return(1);
else
return(recursive(n- 1) + recursive(n - 1));
}
- a)O(n)
- b)O(n logo)
- c)O (n2)
- d)O(2n)
Correct answer is option 'D'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Verified Answer
The time complexity of the following C functionis (assume n > 0)int...
The given C function is recursive. The best way to find the time complexity of recursive function is that convert the code (algorithm) into recursion equation and solution of the recursion equation is the time complexity of given algorithm.
1. int recursive (int i){
2 . if ( n == 1) return (1);
3. else
4. return (recursive(n-1) + recursive(n-1));
5. }
Let recursive(n) - T(n)
According to line 2 if (n = = 1) return(1) then the recursive equation is
T(n) = 1, n = 1
According to line 4 the recursion equation is
T(n) = T ( n - 1 ) + T(n-1), n > 1
So the complete recursion equation is
2 . if ( n == 1) return (1);
3. else
4. return (recursive(n-1) + recursive(n-1));
5. }
Let recursive(n) - T(n)
According to line 2 if (n = = 1) return(1) then the recursive equation is
T(n) = 1, n = 1
According to line 4 the recursion equation is
T(n) = T ( n - 1 ) + T(n-1), n > 1
So the complete recursion equation is
Most Upvoted Answer
The time complexity of the following C functionis (assume n > 0)int...
The time complexity of the function can be determined by analyzing the number of iterations in the for loop.
The for loop runs from i = 1 to n, incrementing i by 2 at each iteration. This means that the loop will run n/2 times.
Inside the loop, there is a single statement that takes constant time to execute.
Therefore, the time complexity of the function is O(n/2), which simplifies to O(n).
The for loop runs from i = 1 to n, incrementing i by 2 at each iteration. This means that the loop will run n/2 times.
Inside the loop, there is a single statement that takes constant time to execute.
Therefore, the time complexity of the function is O(n/2), which simplifies to O(n).
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer?
Question Description
The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer?.
The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer?.
Solutions for The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer?, a detailed solution for The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? has been provided alongside types of The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice The time complexity of the following C functionis (assume n > 0)int recursive (int n){if (n == 1)return(1);elsereturn(recursive(n- 1) + recursive(n - 1));}a)O(n)b)O(n logo)c)O(n2)d)O(2n)Correct answer is option 'D'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup