As an expert in the field of computer science and mathematics, I can tell you that the divide and conquer strategy is an algorithmic paradigm, not something that can be attributed to a single individual. It is a method for efficiently solving a problem by breaking it down into smaller, more manageable subproblems. This approach is used in various areas, including sorting algorithms like QuickSort and MergeSort, as well as in many other computational problems.

The concept of breaking a problem into smaller parts to solve it more easily dates back to ancient times and is a fundamental principle in many fields. However, the specific application of divide and conquer in the context of computer science and algorithms became more prominent with the advent of computer algorithms and the need for efficient problem-solving methods.

Here's the translation:

作为计算机科学和数学领域的专家，我可以告诉你，“分治法”是一种算法范式，而不是可以归因于单个个体的东西。它是一种通过将问题分解成更小、更易管理的子问题来有效解决问题的方法。这种方法在各个领域都有使用，包括像快速排序和归并排序这样的排序算法，以及许多其他计算问题。

将问题分解成更小的部分以便更容易解决的概念可以追溯到古代，并且在许多领域都是一个基本原则。然而，在计算机科学和算法的背景下，随着计算机算法的出现以及对高效问题解决方法的需求，分治法的具体应用变得更加突出。

read more >>

The maxim divide et impera has been attributed to Philip II of Macedon, and together with the maxim divide ut regnes was utilised by the Roman ruler Caesar and the French emperor Napoleon.read more >>