@amir can u explain a bit more... On Tue, Dec 7, 2010 at 10:09 PM, Amir hossein Shahriari < [email protected]> wrote:
> @jai : since sum of all values in C is between -n and n the last step can > be done in O(n) time and O(n) space > > > On Sun, Dec 5, 2010 at 12:44 PM, jai gupta <[email protected]>wrote: > >> @fenghuang: the last step will take O(n logn ) . Or there is some better >> way? >> >> -- >> 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]<algogeeks%[email protected]> >> . >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Aditya Kumar B-tech 3rd year Computer Science & Engg. MNNIT, Allahabad. -- 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.
