Register

Recurrence relations

• retagged by
659 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · TOC Extended Trans...Next → · Functional Dependenc...
← Previous in category · GraphNext in category → · Introduction to algo...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
practicalmetal asked Sep 15, 2023
1,197 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...
0 0 votes
1 1 answer
799
799 views
Lakshman Bhaiya asked Nov 1, 2018
799 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})$ ...
0 0 votes
1 1 answer
967
967 views
iarnav asked May 25, 2017
967 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 s...
1 1 vote
2 2 answers
693
693 views
learncp asked Jan 17, 2016
693 views
Calculating time compleity of recurrence relations.
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions-1.A(n){if(n<=1) return (n);else{ return ( A(...