How to split an array into groups with equal sums in each group?

Question

css

Colleagues, tell me an algorithm that can be used to split an array of numbers into n groups so that the sums of numbers in each group are as close as possible?

Answer 1

codepen.io/anon/pen/mErzbV

Answer 2

Дизайнер ушлёпок! Если начал рисовать под сетку, так что ему мешало сдвинуть 1-й и 3-й блок по центру?)

Answer 3

как написали выше, родительский блок поставте по центру, затем внутри 5 блоков float:left; или display:inline-block; все оч просто)

Answer 4

Попробуйте flexbox:
frontender.info/a-guide-to-flexbox
https://css-tricks.com/snippets/css/a-guide-to-flexbox/
www.sketchingwithcss.com/samplechapter/cheatsheet.html

Answer 5

The sum of the entire array must be divided into the number of groups (compare the arithmetic number in the group to which we will strive) and in turn type into groups, starting from the largest digit (element value) from the array. As soon as the sum in the group exceeds the arithmetic mean, skip and go to the next group, and so on until the smallest of the entire array remains, which, after the 1st excess cycle, falls into the group with the smallest excess of the target sum.
PS: an indiscreet question is possible: why would this be useful?

Answer 6

Read the algorithms of the rucksack packing problem - you get a variation of it with a common penalty for several rucksacks.