Recursive is a kind of programming technique which can realize the divide-and-conquer method naturally.
递归是一种自然地实现分而治之解决问题的编程技术。
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.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
Divide-and-conquer alignment (DCA) method is one of such programs.
分治对齐方法(DCA)就是这样一个比较好的程序。
This paper utilizes the "divide and conquer" method, solves the presented model, analyzes the model's problems, and finally points out the future's work.
本文采用了分而治之的方法，对提出的模型进行了求解，并通过分析模型存在的一些问题，指出了下一步的工作。
The divide and conquer method is used very widely in many realms, especially on solving non-numerical calculating problems.
分治法在许多领域，尤其是非数值计算机领域中应用十分广泛。
The divide and conquer algorithm is an important and efficient method to many problems.
分治算法是解决许多实际问题的重要而有效的方法。
The divide and conquer algorithm is an important and efficient method to many problems.
分治算法是解决许多实际问题的重要而有效的方法。
应用推荐