> Hi! > > Could it be, "Nuen9", that you would like to find a split where the > split sums are close to each other? In other words, you define the > number of splits (in your example: 3) and the algortihm should test all > possible combinations and select the split where the sum differences are > smallest. > > Best, > Kimmo
Yes it is, I want example python code for finding my answers but I don't code my answers. please help me. -- https://mail.python.org/mailman/listinfo/python-list
