given a set of S of n integers and another integer x,determine whether or not there exists two elements in S whose sum is exactly x..running time should be (n lgn)
-- ***** RASHMI JAIN 3rd Year,B.E.(IT) Delhi technological University * -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
