Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
find recursive time complexity of fibonacci series by substitution method
sumit_kumar
asked
in
Algorithms
Jun 25, 2017
retagged
Jul 8, 2022
by
Lakshman Bhaiya
3,132
views
3
votes
3
votes
what is time comlexity procedure for following recursive equation by substitution method:
T(n)= T(n-1)+T(n-2) , if n>=2
=1 , if n=1;
=0 , if n=0.
time-complexity
algorithms
recurrence-relation
sumit_kumar
asked
in
Algorithms
Jun 25, 2017
retagged
Jul 8, 2022
by
Lakshman Bhaiya
by
sumit_kumar
3.1k
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
0
votes
by naive fibonacci algo its sigma(c2pow(n/2))
by clever algo its 0(n2)
naive sol
T(n)=T(n-1)+T(n-2)
>=2T(n-2)+c
.......
>=2 pow(k)T(n-2.k)+c(2pow(k-1)+2pow(k-2)+.........+1)
sigma(c2pow(n/2))
abhishek tiwary
answered
Jun 30, 2017
by
abhishek tiwary
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
2
answers
1
Himanshu Goyal
asked
in
Algorithms
Oct 12, 2016
1,222
views
What will be the time complexity of recurrence relation T(n)=c+T(n-1) using substitution method?
What will be the solution of the recurrence relation $T(n)=c+T(n-1)$ using substitution method? c is a constant here.
Himanshu Goyal
asked
in
Algorithms
Oct 12, 2016
by
Himanshu Goyal
1.2k
views
recurrence-relation
algorithms
5
votes
5
votes
1
answer
2
piyushkr
asked
in
Algorithms
Dec 23, 2015
5,046
views
What will be the time complexity of recurrence relation T(n)=2T(n-1)+c using substitution method?
Where c is constant.
piyushkr
asked
in
Algorithms
Dec 23, 2015
by
piyushkr
5.0k
views
algorithms
recurrence-relation
1
vote
1
vote
1
answer
3
K Praveen Kumar
asked
in
Algorithms
Jun 13, 2017
8,354
views
Time complexity of fibonacci series
How to find time complexity of fibonacci series ? Answer is given O (2^n). But i couldn't get it Recurrence eq : T(n) = T(n-1) + T(n-2) + c. By back substitution i got, T(n) = T(n-1) + T(n-2) + c T(n) = 2*T(n-2) + ... (n-4) + 3*T(n-5) + 7c etc ... I'm unable to proceed to next steps.. After that what would be the procedure? Could anyone please explain?
K Praveen Kumar
asked
in
Algorithms
Jun 13, 2017
by
K Praveen Kumar
8.4k
views
time-complexity
recurrence-relation
1
vote
1
vote
1
answer
4
LavTheRawkstar
asked
in
Algorithms
Jan 30, 2017
810
views
Solve using Substitution method (.i.e Guess method only) for finding the Upper Bound
Solve 1) T(n) = 8T(n/2) + n2 a)T(n)= O(n3) True or False ? b)T(n)=O(2n) True or False ?
LavTheRawkstar
asked
in
Algorithms
Jan 30, 2017
by
LavTheRawkstar
810
views
algorithms
time-complexity
asymptotic-notation
recurrence-relation
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy