C algorithm for Partition issues

Question

Given a set of integers S:

How can the set be divided into k parts such that the sum of each part is minimal? Please give also a C implementation.

Example:

S = {1, 2, 3, 4, 5, 6} and k = 3

The partition

 S1 = {1, 6}
 S2 = {2, 5}
 S3 = {3, 4}

has the property that the sum of each partition is minimal.

Nope, just curious to know your ideas or algorithms to compute this as fast as posiible, could be just pseudocode instead of `C` code — edgarmtze, Mar 21 '11 at 22:06
What if some parts have different sums. Are we trying to minimize the maximum sum of the partitions? — Null Set, Mar 21 '11 at 22:11
No, we're trying to divide the numbers as "fair as possible" so that biggest difference between two partition sums is as small as possible. Read the introduction on the page I linked, it's very good at explaining the problem. — orlp, Mar 21 '11 at 22:15

score 2 · Accepted Answer · answered Mar 21 '11 at 22:01

2

This page describes the problem fairly well and even provides pseudocode for an algorithm:

answered Mar 21 '11 at 22:01

orlp

I don't think this answer is correct, the algorithm you suggest solves it assuming the arrangement is kept the same. – st0le Mar 28 '11 at 11:44

score 1 · Answer 2 · answered Jun 07 '19 at 09:55

1

Determine min, max in the given list and form a pair. Repeat until the list is exhausted.

Intuitively it seems it will ensure the desired result, but not sure though!

answered Jun 07 '19 at 09:55

Rushikesh

2 Answers2