sort two of the list and pick one number in C(unsorted) to find if there exists a pair with the sum. This can be done in linear time by maintaining two pointers. Hence O(n^2).
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.