I have found that
X + Y sorting is an open computer science problem but that book was too old and then I have google it but didn't find any strong evidence that it is still open or there is an algorithm that can solve it in O(n2) comparison without using
Fast Fourier Transform.
Is there any algorithm proposed that can solve it in O(n2) comparison or
is it still unsolved?