From: jonty <jontyjont@...>
Date: 2008-01-28T06:01:23+09:00
Subject: Re: [QUIZ] Making Change (#154)

Thanks Yoan - back to the drawing board!

Yoan Blanc wrote:
> jonty wrote:
>   
>> Hi, my solution is a lot simpler than most posted so far
>>
>> As the aim is to find only the optimum solution all I do is
>> working with the largest coin first find out the maximum number of
>> those we can use
>> and then the next largest and so on which self-evidently is the
>> optimal solution.
>> make_change(24, [10,8,2])
>>     
> 24 requires:
> 2 of coins of value 10
> 0 of coins of value 8
> 2 of coins of value 2
>
> where the (self-evidently) optimal solution is:
>
> 24 requires:
> 0 of coins of value 10
> 3 of coins of value 8
> 0 of coins of value 2
>
> Cheers,
>
> -- Yoan
>
>
>
>