Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons

DOI10.1016/0304-3975(92)90089-XzbMath0753.68032MaRDI QIDQ1199530

J. L. Lambert

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

sorting \(n^ 2\) sums

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• How good is the information theory bound in sorting?
• Lower bounds for sorting of sums
• Sorting X + Y
• Unnamed Item

This page was built for publication: Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons