If this can be done, then the divide-and-conquer algorithm is a good choice.
如果可以这么做,那么分治算法是个好的选择。
Tackling large legacy code bases: divide and conquer.
追踪大型合理代码基底:分割和克服。
Divide and conquer using master and affiliated documents.
使用主文档和附属文档分割大的文档,并克服大文档的问题。
And that's because that is a version of a divide and conquer algorithm.
这个想法非常重要,因为这就是分而治之算法的一个版本。
How do we take a complex program, again, divide and conquer, I feel like a 1-trick pony, I keep repeating the same thing over and over again.
同样的先分解再逐个击破,我就像只会一个把戏的小马,我不断重复相同的事情。
So if I try to apply the same logic, well how can I divide and conquer this problem.
如果我想要用同样的逻辑,那么怎样划分,并解决这个问题呢?
应用推荐