【摘要】 利用动态规划技术,将汉诺塔的递归算法用填表的方式自底向上递推来实现,分析递推算法的时间复杂性,观察出来输出汉诺塔的解的时间是O(2n)增长的,通过一个形象的想象帮助我们理解求解汉诺塔问题涉及到的巨大的时间概念。更多还原

【Abstract】 The dynamic programming technology was used to translate the recursive procedure of a famous problem named Hanoi tower to a iterative development process.Then the complexity of running time was analyzed.It is found that the solution length is in O(2n),finally a vivid imagination is given to help us to understand Hanoi tower problem concerning the huge time concept.更多还原