Divide a set into two partitions such that the difference of sum of subsets is minimum
Answers
Answered by
0
Partition a set into two subsets such that the difference of subset sums is minimum. Given a set of integers, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum.
hope it helped you
please mark as brainly
Similar questions