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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.