Time complexity

#1

what is the time complexity of rod cutting problem using recursion and dp approach both

#2

hello @shashankmaheshwari054

in both the cases it will be O(n^2)

#3

using recursion also

#4

…

you were asking about top down dp right?it will be O(N^2)

in case of recursion(with no memoisation) it will be exponential.

#5

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.