Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Extended Hanooi Tower
dear all
I should write recursiv & nonrecursive version of extended Hanoi tower. Extended Hanoi tower is similar the normal one. The difference is that here odd rings are in A (1,3,5) and even rings are in B (2,4,6). Now how we can transfer all of them to one with recursive function & a nonrecursive function!!! (Note 1 is the biggest ring and we can't place bigger one on the smaller one)
Thanks in advance
Related threads:
Re: Extended Hanooi Tower
Recursive algorithms involve methods that call themselves, non-recursive alternatives typically involve while loops. Given the question it is a hard to provide further advice...I recommend reading the following: How to Ask Questions
Reply With Quote