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!
Program an exclusive OR operation with logical operators
584 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
374 Solvers
106 Solvers
The Answer to Life, the Universe, and Everything
297 Solvers
Celsius to Fahrenheit converter
262 Solvers