retagged by
543 views
0 votes
0 votes
T(n) = 3T(n-1) -4T(n-2) + 2T(n-3)

If n = 0 then T(n) = 1

 if n= 1 or 2 then T(n) = 0

What is the generalized solution?
retagged by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
0 votes
0 votes
1 answer
2
practicalmetal asked Sep 15, 2023
337 views
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 votes
0 votes
1 answer
3
2 votes
2 votes
1 answer
4
yuyutsu asked Jun 22, 2022
597 views
T(n) = 5T(n/3) + T(2n/3) + 1.My answer is BigOmega(n) BigO(n). Am I right? This is a question I found on cs.stackexchange.