加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Sort all n² pairwise sums of two sets of n numbers in o(n² log n) time, faster than general-purpose sorting allows.
PR 把工作从一条路线带到另一条；合并它就是采纳。