可以证明，这种递归解法需要耗费指数级的时间。
It can be shown that this recursive solution takes exponential time to run.
对“梵塔”问题的递归和非递归解进行了讨论；提出了较递归解法更好的非递归解法；
The paper discusses both of the recursive and non - recursive solution of the Hanoi problem and delivers a non - recursive solution, which is better than the existed recursive one.
对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行。
For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solutio.
对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行解。
For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solution.
对于背包问题这样一个经典的递归问题，发现了它的不需栈支持的循环解法，并由此说明其存在并行解。
For knapsack problem (which is a classical recursion problem), find its round solution which need not stack to support, then prove it exists parallel solution.
应用推荐