hi all,

i have a small problem for all those of you who love python programming...
it goes like this .......
the user gives some n nos. as input ......
then we need to divide them in to two groups such that the difference
between the sum of  square roots of the nos in each group is the least
using minimum cpu
time......
for better understanding here is an example..........
suppose i have 10 nos....
1,2....10
then i need to partition sqrt(1),sqrt(2)......sqrt(10) in to two groups
such that their sum is almost same or the difference is the least......


Hi, welcome ....

I think you've accidentally "double posted" this - the same question's on the Pythion board.   As that's a better place for it, I'm going to lock the thread here and answer in the other place.

---