2,162 views

2 Answers

Best answer
3 3 votes

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

selected by
1 1 vote

ANSWER FOR THE Nth TERM OF FIBONACCI SERIES.

Position:
Show:

Related questions

0 0 votes
1 1 answer
301
301 views
arbpass asked Sep 11, 2025
301 views
How to check if f(n) is polynomially greater than g(n)?
0 0 votes
1 answers 1 answer
2.9k
2.9k views
Shreya2002 asked Oct 27, 2022
2,917 views
How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-
1 1 vote
2 answers 2 answers
1.8k
1.8k views
srestha asked May 10, 2019
1,823 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
2 2 votes
2 2 answers
10.1k
10.1k views
pradeepchaudhary asked Jul 14, 2018
10,148 views
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)...