Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
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 all is quiet...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (10)
As of 2017-04-27 21:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (514 votes). Check out past polls.