网络释义专业释义英英释义
分治法 divide and conquer algorithm 十分 very; fully; utterly; extremely; completely; 十分爱惜人力物力 use manpower and material resources most sparingly...
基于8个网页-相关网页
Divide and conquer algorithm
- abstract: In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly.
以上来源于: WordNet
双语例句原声例句
-
And that's because that is a version of a divide and conquer algorithm.
这个想法非常重要，因为这就是分而治之算法的一个版本。
-
The divide and conquer algorithm is an important and efficient method to many problems.
分治算法是解决许多实际问题的重要而有效的方法。
-
But in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.
但在找不到最优解的情况下，最大互关联算法更精确。
-
And that's because that is a version of a divide and conquer algorithm.
这个想法非常重要,因为这就是分而治之算法的一个版本。
-
A really nice algorithm. As I said, an example of divide and conquer.
真的很好的一个算法，就如我说的。
-
Notice here that it's different than the binary search case. We're certainly dividing down, but the combination now actually takes some work. I'll have to actually figure out how to put them back together. And that's a general thing you want to keep in mind when you're thinking about designing a divide and conquer kind of algorithm.
一个分治的例子,注这里，与二分查找所不同的地方,我们肯定是分解了,但是合并的过程还是需要一些工作量的,我会详细说明怎样把它们合并在一起的,当你在考虑设计一个分治算法时,这是你要必须记住的最基本的东西。
应用推荐