X + Y sorting
Problem of sorting pairs of numbers by their sum
In computer science, X + Y sorting is the problem of sorting pairs of numbers by their sums. Applications of the problem include transit fare minimisation, VLSI design, and sparse polynomial multiplication.
