
As mentioned in the class, the modern 3Sum conjecture states that there is no 3Sum algo- rithm that runs in time O(n) for fixed e0. Show this bound, if true, is almost tight. More precisely, provide an algorithm which answers the 3Sum problem in time O(n2). You can described your algorithm either in English words or using a pseudocode. If you use a pseudo-code, provide a short justification for the correctness of your
PayPal Gateway not configured
PayPal Gateway not configured