Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^3: The greedy change-making problem using regexes

by japhy (Canon)
on Mar 10, 2005 at 12:32 UTC ( #438214=note: print w/replies, xml ) Need Help??


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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://438214]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2021-04-15 06:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found
    Notices?