From: Raffa Date: 2008-01-30T19:59:57+09:00 Subject: Re: Making Change (#154) i found a solution that can process inputs like "make_change 1_000_000_000_000 4 3 7 6 85 98 54 22 3423 34 509 435 243 345" in < 0.2 sec. (in super no-optimization / ultra-verbose mode) - no recursion & stack - possibility to add coins after the processing don't affect the previous memoizing array at all - it is simple do it manual (pencil / notebook), cause all to do is to take note of some x/y integer part and rest i haven't seen all solutions posted, so i don't know if this algorithm is just been presented, if no, then i'll post in next minutes (sorry for my bad english)