Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^3: Divide an array into 2 subsets to verify their sum is equal or not.

by kcott (Chancellor)
on May 02, 2013 at 21:19 UTC ( #1031806=note: print w/replies, xml ) Need Help??


in reply to Re^2: Divide an array into 2 subsets to verify their sum is equal or not.
in thread Divide an array into 2 subsets to verify their sum is equal or not.

++ Thanks. All your points are perfectly valid. There were other issues as well. I've substantially rewritten the solution.

-- Ken

  • Comment on Re^3: Divide an array into 2 subsets to verify their sum is equal or not.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (8)
As of 2018-09-25 20:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Eventually, "covfefe" will come to mean:













    Results (205 votes). Check out past polls.

    Notices?
    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!