is sort the array using merge sort but the only difference is that during merge skip the step where we compare same number and it will take O(nlogn) time correct me if i'm wrong. On Jun 2, 11:19 pm, "D.N.Vishwakarma@IITR " <deok...@gmail.com> wrote: > better than O(n2) algo > > -- > **With Regards > Deoki Nandan Vishwakarma > IITR MCA > Mathematics Department* > *
-- 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.
