a1a2a3b1b2b3 => [a1 a2] a3 [b1 b2] b3 => [a1 a2] [b1 b2] a3 b3 => a1 a2 b1 b2 a3 b3 => a1 b1 a2 b2 a3 b3
The algo. that I put forth works. And I think Sourav's will as well. The grouping needs to be in numbers of 4. The total number of elements need not. -Minotauraus. On Jun 13, 1:46 pm, Pramod Negi <negi.1...@gmail.com> wrote: > Hello All, > > What every algorithm mentioned above have some problem. > > The Recursive swapping won’t work if you don’t have 2^n elements. > > Same with getting the indexes, it will form a cycle. > > Thanks > > Pramod Negi > > On Fri, Jun 11, 2010 at 7:09 PM, sharad kumar <sharad20073...@gmail.com>wrote: > > > > > excellent soln!!!!!! > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algoge...@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.
