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

Deviding N(1,2,3,..,N) part from numeric list as summation of each values(don't sorted) has highest as possible. The first I'm sorry for my English language. I have a list is land = [10,20,30,40,110,50,18,32,5] and I want to find each values of summation (don't sorted values in list) as It ha

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

เมื่อ วันจันทร์ที่ 10 ตุลาคม ค.ศ. 2016 21 นาฬิกา 31 นาที 25 วินาที UTC+7, Steve D'Aprano เขียนว่า: > On Tue, 11 Oct 2016 12:38 am, amornsak@gmail.com wrote: > > > I have a list is > > > > land = [10,20,30,40,110,50,18,32,5] > > > > and I want to find each values of summation (don't sorted v

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

เมื่อ วันจันทร์ที่ 10 ตุลาคม ค.ศ. 2016 22 นาฬิกา 46 นาที 33 วินาที UTC+7, K. Elo เขียนว่า: > 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

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

> 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 spl