Can you please help me to find out time complexity of give recurrence equation -
A(m,n) = n+1 if m=0
= A(m-1,1) if n = 0
= A(m-1,A(m,n-1)) otherwise
and also
T(n) =4T(n/2)+n^2. when n>1
= 1. when n=1
Please help I dont know how to solve this
You shall study master theorem to answer them. Its complexity can be calculated very easily using it. Its O(logn.n^2)
A(m,n) = n+1 if m=0
= A(m-1,1) if n = 0
= A(m-1,A(m,n-1)) otherwise
What about this
How to solve this question?
You need to make the recursion tree, get the tree height and calculate complexity at each level.
Please study theorams for calculating complexities. You can find them on youtube
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.