Deviding N(1,2,3,..,N) part from numeric list as summation of each values(don't sorted) has highest as possible.

[breamoreboy at gmail.com]

On Monday, October 10, 2016 at 5:25:46 PM UTC+1, Nuen9 wrote:
> > 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.

Awfully sorry but we don't write your code for you.  I suggest that you read any Python tutorial and try running code at an interactive prompt, then when you run into problems ask a specific question about a specific problem.

Kindest regards.

Mark Lawrence.