what would be the O(n^2) sol. to this ...!! On Tue, Jul 19, 2011 at 12:41 AM, snehi jain <snehijai...@gmail.com> wrote:
> can it be solved in less than O(n^2) like O(nlogn ) types.. > i cant figure out any solution less than O(n^2). > > > On Tue, Jul 19, 2011 at 12:37 AM, ankit sambyal <ankitsamb...@gmail.com>wrote: > >> @Snehi :If the elements are random, then it seems that this problem >> can't be solved in O(n) time >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@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. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > -- Shubham Maheshwari ShubZz O.o o.O enJoY ...!!! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
