Coin counting algoritham

hello guys,

In my multiplayer game application at one stage i need to calculate the coins required to get particular amount..

for that there is one algoritham i have seen at

http://www.seeingwithc.org/topic1html.html

i have tried to understand third apporach of dynamic programming but in that case what is denom as argument to function..

i am thank ful to who ever wrote this algoritham but he has not given very clear note in that,,what is danom in it...what i have to pass as denom...

if anyone can solve this problem than please reply soon,,it is very nice for me..

if any other algoritham is there for finding coins for required amount than please give me link so i can see that...

thank you....

[757 byte] By [raj_rajaa] at [2007-10-2 2:04:35]
# 1

Why do you want to do the 3rd example? The first is far easier. In the problem description and after the pseudocode of example 1, there is a clear explanation of all the parameters (denom, amt; counts).

So just give it a try, and if you get stuck, post the your code here and tell what's wrong with it.

Good luck.

prometheuzza at 2007-7-15 19:46:03 > top of Java-index,Other Topics,Algorithms...
# 2
Since http://dictionary.reference.com/search?q=denominationand then he writes 'Both denom and counts are declared to be arrays of integers.'I would guess 'denom' contains the different sizes of the bills.
parza at 2007-7-15 19:46:03 > top of Java-index,Other Topics,Algorithms...