Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

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

by Anonymous Monk
on Mar 10, 2005 at 13:14 UTC ( #438232=note: print w/ replies, xml ) Need Help??


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

Which is the correct answer for the greedy algorithm. But see my posting elsewhere in this thread for a more general solution.


Comment on Re^4: The greedy change-making problem using regexes

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (6)
As of 2015-07-30 01:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (269 votes), past polls