Simple solution of order O(n^2), similar to bubble_sort, is obvious... Any improvements ???
On Sun, Jun 5, 2011 at 7:03 PM, Arunachala Karthik < [email protected]> wrote: > > What is the order of time specified in the question? > > On Thu, Jun 2, 2011 at 5:03 PM, siva viknesh <[email protected]>wrote: > >> >> In a given array of elements like [a1, a2, a3, a4, ..... an, b1, b2, b3, >> b4, ....... bn, c1, c2, c3, c4, ........ cn] >> >> without taking a extra memory how to merge like [a1, b1, c1, a2, b2, c2, >> a3, b3, c3, ............ an, bn, cn] ..??? >> >> >> >> >> -- >> Regards, >> $iva >> >> -- >> 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. >> > > -- > 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. > -- 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.
