X + Y sorting
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.
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.
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.
Source: Wikipedia "X + Y sorting" · CC BY-SA 4.0
Share this article: X · Bluesky