in reply to Re^2: The greedy change-making problem using regexes
in thread The greedy change-making problem using regexes

No, that doesn't work: it ends up using three coins (a dime and two pennies) for 12 cents, instead of two six-cent coins.
_____________________________________________________
Jeff japhy Pinyan, P.L., P.M., P.O.D, X.S.: Perl, regex, and perl hacker
How can we ever be the sold short or the cheated, we who for every service have long ago been overpaid? ~~ Meister Eckhart
  • Comment on Re^3: The greedy change-making problem using regexes

Replies are listed 'Best First'.
Re^4: The greedy change-making problem using regexes
by Anonymous Monk on Mar 10, 2005 at 13:14 UTC
    Which is the correct answer for the greedy algorithm. But see my posting elsewhere in this thread for a more general solution.
[reply]

In Section Meditations