java - Algorithm to find k (k<100) largest differences (by absolute value) from an array of maximum 100 integers -



java - Algorithm to find k (k<100) largest differences (by absolute value) from an array of maximum 100 integers -

if have array of integers in random order (the length n < 100), , asked find k integers (where k < n), when grouped in array have largest sum of two-consecutive-term differences absolute value (which i'll refer sum), algorithm fastest task?

e.g: array 3 1 2 4 3 has sum equal to: |(3-1)| + |(1-2)| + |(2-4)| + |(4-3)| = 6.

java algorithm

Comments

Popular posts from this blog

xslt - DocBook 5 to PDF transform failing with error: "fo:flow" is missing child elements. Required content model: marker* -

mediawiki - How do I insert tables inside infoboxes on Wikia pages? -

Local Service User Logged into Windows -