Problem 492. Find best placement for ordered dominoes (harder)
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.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers332
Suggested Problems
-
350 Solvers
-
Back to basics 6 - Column Vector
1083 Solvers
-
Back to basics 12 - Input Arguments
611 Solvers
-
Create matrix of replicated elements
385 Solvers
-
Find out sum and carry of Binary adder
1610 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!