Minimum Coin Problem (Bottom Up and Top Down Approach)

#1

What is the time Complexity here in bottom up approach ?
Isn’t it O(n*m), because of 2 for loops ?
n=Given Number.
m=Number of denomination in coins array.
Isn’t this time complexity bad ?
Also, what is the time complexity in top down approach ?

#2

@ayush.mishra8799,

Isn’t this time complexity bad ?

Can you do better?

Also, what is the time complexity in top down approach ?

Same

#3

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.