5 ms·Fast Exponential Algorithms6 points by TriinT 17y agojibiki 17y agoVaguely related problem: say A and B are sets of size n. How fast can you sort A+B = {a+b | a in A ; b in B}?jacquesm 17y agoThat's actually quite closely related to the 'merge' step of quicksort, where both half sets are sorted independently and then merged.jongraehl 17y agoOkay, but how is it related?