广义Hanoi塔问题的求解算法和时间复杂度分析

Aeorithm and Time Complexity Analysis of Generalized Hanoi Tower Problem

对递归问题的典型代表Hanoi塔问题作了一些变化,就圆盘的大小、个数及辅助柱的个数进行了推广,给出了这种广义Hanoi塔问题的求解算法和时间复杂度分析。该算法对研究一般递归问题具有一定的借鉴作用。 }

Some changes are made on the typical examples of Hanoi tower problems in recursive problems, the size and number of discs and the number of assistant posts are introduced. The algorithm and time complexity for solving the generalized Hanoi tower problems are analyzed, which helps the research of the general recursive problems.