Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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.
This page describes the problem fairly well and even provides pseudocode for an algorithm:
http://www8.cs.umu.se/kurser/TDBAfl/VT06/algorithms/BOOK/BOOK2/NODE45.HTM