Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

In English!!!

Options
  • 03-11-2002 4:56pm
    #1
    daveirl
    Closed Accounts Posts: 14,483 ✭✭✭✭


    This post has been deleted.


Comments

  • Options
    #2
    carl_
    Registered Users Posts: 179 ✭✭carl_


    youve got a Set, W consisting of n (any number) different weights.
    u have to partition (split) the set into two sets (w1 and w2) such that the sum of the weights in w1 is the same as the sum of the weights in w2.
    there may be (most likely will be) more than one way to split the set that obeys the conditions and u have to work out an algorithm that will find all such splits for any given W.

    btw the term disjoint sets means anything thats in set A is not in set B and vice versa.

    hope this helps :)


  • Options
    #3
    daveirl
    Closed Accounts Posts: 14,483 ✭✭✭✭daveirl


    This post has been deleted.


Advertisement