I am currently learning the dynamic substructure and optimal solution for the coin change-making, and one of the questions given from my teacher is to describe an overall O(n) dynamic programming algorithm that will give the optimal solution and why is it O(n)? Can anyone help me to understand the question? Thank you!
2
-
3$\begingroup$ Can you describe the problem you are interested in? $\endgroup$– Yuval FilmusNov 3, 2019 at 21:31
-
1$\begingroup$ Probably this: en.wikipedia.org/wiki/Change-making_problem $\endgroup$– Matthew CNov 4, 2019 at 0:17
Add a comment
|