Algorithm for counting coins im poker

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:38]
# 1
Hi there,Denom is simply an array of the denominations of the coins - for example in the UK we use (values in pence): 1, 2, 5, 10, 20, 50 and 100 (also 200 and 500)n is the number of these denominations (so 7 excluding 200 and 500)Hope this helps.Pete
Red27a at 2007-7-15 19:46:07 > top of Java-index,Other Topics,Java Game Development...