Recursive is a kind of programming technique which can realize the divide-and-conquer method naturally.

递归是一种自然地实现分而治之解决问题的编程技术。

youdao

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.

分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。

youdao

Divide-and-conquer alignment (DCA) method is one of such programs.

分治对齐方法(DCA)就是这样一个比较好的程序。

youdao