divide-and-conquer technique 分而治之技术
Often, he explains, the best approach is to use a technique known as divide-and-conquer.
他说：“实现并行最好的方法是就采用分治技术”。
Divide-and-conquer is a recursive technique, meaning that it uses some method to split a problem in half, then uses the same method to split those halves in half, and so on.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
Recursive is a kind of programming technique which can realize the divide-and-conquer method naturally.
递归是一种自然地实现分而治之解决问题的编程技术。
应用推荐