• 可以证明这种递归解法需要耗费指数级时间

    It can be shown that this recursive solution takes exponential time to run.

    youdao

  • 塔”问题递归进行了讨论;提出了较递归解法更好递归解法

    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.

    youdao

  • 对于背包问题这样一个经典递归问题,发现了它的支持循环解法,并由此说明存在并行

    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.

    youdao

  • 对于背包问题这样一个经典递归问题,发现了它支持循环解法并由此说明存在并行

    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.

    youdao

  • 对于背包问题这样一个经典递归问题,发现了它支持循环解法并由此说明存在并行

    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.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定