Register

Recurrence relations

• retagged by
439 views

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

0 votes
0 votes
1 answer
1
practicalmetal asked Sep 15, 2023
387 views
Recurrence relations
Consider the following function: function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); } Find the worst case time complexity of function X ?
Consider the following function:function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); }Find the worst case time complexity of function...
User Avatar
0 votes
0 votes
1 answer
2
Lakshman Bhaiya asked Nov 1, 2018
428 views
Recurrence Relations
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then $A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ $D)T(n)=\theta(n^{3}logn)$
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then$A)T(n)=\theta(n^{3})$ $B)T(n)=\theta(n^{2}logn)$ $C)T(n)=\theta(n^{2})$ ...
User Avatar
0 votes
0 votes
1 answer
3
iarnav asked May 25, 2017
595 views
Where to study from recurrence relations from scratch
According to gate CS, where is recurrence relations are used? How to learn to use them in Algorithms in solving T(n) Questions. Kindly mention the video lecture source to study recurrence relations and all the ways to solve them.
According to gate CS, where is recurrence relations are used?How to learn to use them in Algorithms in solving T(n) Questions.Kindly mention the video lecture source to s...
User Avatar
Link Copied!