Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

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

by kcott (Archbishop)
on May 02, 2013 at 22:47 UTC ( [id://1031810]=note: print w/replies, xml ) Need Help??


in reply to Re^4: 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.

Bugger! Yes, you're right. Thanks for pointing that out (++ when the Vote Fairy next visits). That should, of course, be in @test_equal_subsets (8+4+4 = 7+6+3 = 16). Back to the drawing board ...

Update: Bug fixed. Node updated.

-- Ken

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

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (2)
As of 2024-04-19 18:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found