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 scrutinizing the Monastery: (10)
As of 2015-08-31 09:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The oldest computer book still on my shelves (or on my digital media) is ...













    Results (354 votes), past polls