hanio算法,hanoi塔的递归程序，有三个柱子A,B,C在A上的n 个盘，下大上小

重演经典的汉诺塔。 做课程设计时做的，不算太好，呵呵…… 不过还算基本规范吧。适合初学者。-repeat of the classic Tower of Hanoi. Courses designed to do so, not too good, huh ... but it still basic norms. For beginners.

该程序是有关汉诺塔的递归实现,是在VC2.0下实现的,具体算法是递归.-that the procedure was the Tower of Hanoi Recursive is VC2.0 under the specific algorithm is recursive.