Hi all, Pls help me with the solution to the following problem related to the coin changing problem.
suppose that the available coins a ein the denominations c^0, c^1 , c^2... c^k for some intgers c>1 and k>=1. show tht the greedy algorithm always yeilds an optimal solution thanks in advance Preethi -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
