Join
Sorting X + Y: sorting all pairwise sums faster than n² log n
Sort all n² pairwise sums of two sets of n numbers in o(n² log n) time, faster than general-purpose sorting allows.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.