this question discuused before with a proper conclusion... please search the forum
On Sat, Jul 3, 2010 at 11:31 PM, jalaj jaiswal <[email protected]>wrote: > > Let an array contain values : a1,a2,... ,an, b1,b2,..., bn Write a program > to change this array to : a1,b1,a2,b2, ..., an,bn in O(n) time and in O(1) > space. > > i did it by shiftng of elements which is not much efficient.. any better > way ? > -- > With Regards, > Jalaj Jaiswal > +919026283397 > B.TECH IT > IIIT 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Jitendra Kushwaha 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.
