I am planning to write a Java applet for Tower 开发者_开发百科of Hanoi similar to link( http://www.mazeworks.com/hanoi/index.htm )
I like the algorithm mentioned开发者_StackOverflow in this question: \"How does this work? Weird Towers of Hanoi Solution\"
I have a question on the linear Towers of Hanoi. I implemented it in C++ but am trying to do the same using the tail recursive or iterative method. I am having trouble with my algorithm.
加载中,请稍侯......