Given a list of ordered pairs, find the order they should be placed in a line, such that the sum of the absolute values of the differences is minimized.
list = [1 2
5 3
2 4
order = [1 3 2]
yields: [1 2][2 4][5 3]
or: abs(2-2) + abs(4-5)
or: 0 + 1
or: 1
There is a unique best solution, but the score is NOT always zero.
nice!
137 Solvers
203 Solvers
Create a vector whose elements depend on the previous element
272 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
344 Solvers
227 Solvers