Register

Algorithm Doubt

897 views

2 Answers

Best answer
2 votes
2 votes

..................

• selected by
User Avatar
1 votes
1 votes

ANSWER FOR THE Nth TERM OF FIBONACCI SERIES.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Shreya2002 asked Oct 27, 2022
1,098 views
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-
User Avatar
1 votes
1 votes
2 answers
2
srestha asked May 10, 2019
874 views
Made Easy Test Series:Algorithm-Recurrence Relation
What is the solution of recurrence relation $T\left ( n \right )=T\left ( n-1 \right )+n$
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
User Avatar
2 votes
2 votes
2 answers
3
pradeepchaudhary asked Jul 14, 2018
9,196 views
Time Complexity Of the Algorithm
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise. The order of the algorithm is— (a) log n (c) n^2 (b) n (d) n*n
Q.6 The time complexity of an algorithm T(n), where n is the input size, is given by— T(n)= T(n-1) + 1/n, if n>1 = 1, otherwise.The order of the algorithm is�...
User Avatar
2 votes
2 votes
2 answers
4
iarnav asked Apr 3, 2018
1,378 views
#Algorithm Help Solving Recurrence of Select Algorithm with guaranteed Linear time O(n)
Solution to the Recurrence equation $T(n) = T(n/5)+T(7n/10)+O(n)$ is
Solution to the Recurrence equation $T(n) = T(n/5)+T(7n/10)+O(n)$ is
User Avatar
Link Copied!