You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
|Answer» D. o(s*n)|
|Explanation: the time complexity is o(s*n).|
Login to Continue
It will take less than 2 minutes