Can you elaborate the problem a little more? It has been stated in vague manner.
On Fri, Dec 31, 2010 at 10:39 AM, sara <[email protected]> wrote: > I Should Write A Recursive Program Of Extended Hanoi Tower. We Have > A,B,C Like Before But There Is 2n Button. Odd Buttons In A And Even > Buttons In B. For Example If N = 6 In A From Bottom To Up Is 1,3,5 (1 > Is The Largest) And In B 2,4,6. Plz Help Me? > > -- > 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. > > -- Umer -- 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.
