Register

recurrence relation

• recategorized by
427 views
0 votes
0 votes
what is the recurrence relation for binary search and linear search?

please explain how to derive them.
• recategorized by
User Avatar

1 Answer

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

Related questions

5 votes
5 votes
3 answers
1
sushmita asked Oct 4, 2018
2,161 views
recurrence relation MIT
$T(n)=\sqrt{n} T(\sqrt{n})+100n$ Please solve this.
$T(n)=\sqrt{n} T(\sqrt{n})+100n$Please solve this.
User Avatar
1 votes
1 votes
0 answers
2
srestha asked May 19, 2019
629 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
2 answers
3
srestha asked May 10, 2019
871 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,038 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!