The algorithm of the need to group files of different sizes into approximately equal blocks

Question

I'm trying to find an algorithm that will help me group various files of different sizes into groups of "n" about the same size.

Any ideas on how to achieve this?

Answer 1

Find the target group size. This is the sum of all sizes divided by n.
Create a list of sizes.
Sort the files decreasing in size. 
for each group
    while the remaining space in your group is bigger than the first element of the list
        take the first element of the list and move it to the group
    for each element
        find the elemnet for which the difference between group size and target group size is minimal
    move this elemnt to the group

This does not give optimal results, but it is easy to implement and get good results. For an optimal solution, you need an exhaustive search that is NP complete.

Answer 2

K , . , , 1-, k- .

Answer 3

, , n, . bin, .

Netlib fortran code, ( , / ).