wu :: forums - Print Page


    
      
        wu :: forums
        (http://www.ocf.berkeley.edu/~wwu/cgi-bin/yabb/YaBB.cgi)
      

        riddles >> cs >> Partition an array in 2 s.t. sum is same for both
        
(Message started by: hikushalhere on Feb 8^th, 2012, 6:21pm)

Title: Partition an array in 2 s.t. sum is same for both
Post by hikushalhere on Feb 8^th, 2012, 6:21pm

Partition an array os size n into two parts so that the sums of both parts are same. The array contains integers and is unsorted.

Title: Re: Partition an array in 2 s.t. sum is same for b
Post by Grimbal on Feb 9^th, 2012, 2:16am

It is called the partition problem.
http://en.wikipedia.org/wiki/Partition_problem