Search found 1 match

Go to advanced search

by bik29
Tue Oct 08, 2002 10:50 pm
Forum: Volume 1 (100-199)
Topic: 166 - Making Change
Replies: 31
Views: 12387

166 - Making Change

Hi,
I have been trying to solve this problem with the following algorithm:


1. Keep an array of size 10000 (big enuf I think) and calculate the minimum number of coins needed to make an amount between 1 and 10000 ( -1 if it is not possible), assuming that all the denominations are available in ...

Go to advanced search