该程序用非递归的方法实现了汉诺塔问题的求解。当源盘的数目较少时该算法的执行速度比递归算法快，但当源盘块数较多时递归算法执行速度块-the program with non- recursive method of the Tower of Hanoi problem solving. When the source of the relatively small number of sites at the time of the algorithm implementation rate faster than the recursive algorithm, However, the source disk few more blocks when recursive algorithm execution block