Register

RECURRENCE RELATION DOUBT

350 views
0 votes
0 votes
Which of the following methods enlisted can be termed as best and appropriate for solving recurrence relation?

1)Substitution Method

2)Recurrence Tree

3)Master's Theorem
User Avatar

Please log in or register to answer this question.

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

Related questions

1 votes
1 votes
0 answers
1
srestha asked May 19, 2019
639 views
Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
User Avatar
1 votes
1 votes
1 answer
2
jenilS7 asked Mar 18
139 views
Recurrence relation
What is the returned value by the given function below. Algo fun(n) { If(x<=2) return 1; Else { Return fun(n1/2) + n; } } Note : Assume that all the syntax and data type constraints are valid and just check algorithm.
What is the returned value by the given function below.Algo fun(n){ If(x<=2) return 1; Else { Return fun(n1/2) + n; }}Note : Assume that all...
User Avatar
1 votes
1 votes
2 answers
3
srestha asked May 10, 2019
892 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
1 votes
1 votes
1 answer
4
VikramRB asked Jan 20, 2019
1,050 views
Recurrence relation and Time Complexity
What is the time complexity of the following recurrence relation and step to derive the same $T(n) = T(\sqrt{n}) + log(logn)$
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$
User Avatar
Link Copied!