how can I find an upper bound and a lower bound for this recursive relation?

Asked Oct 23 '20 at 10:22

Active Oct 23 '20 at 10:22

Viewed 86 times

However hard I try I can't use the master theorem to solve this relation. Is there a way to do this. Any other ideas?

T(n,m) = T(n-1,m)+T(n,m-1)+1

asked Oct 23 '20 at 10:22

Hosna

0 Answers0