A typical parallel divide-and-conquer algorithm takes the form shown in Listing 1.
典型的并行divide - and - conquer算法的形式如清单1所示。
Our algorithm employs the Divide and Conquer strategy, bisection and secants iteration.
该算法以二分法、割线法迭代为基础，采用分而治之策略。
But in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.
但在找不到最优解的情况下，最大互关联算法更精确。
By combining the internal buffering technique and the float hole technique with the divide-and-conquer technique, a fast linear-time in-place 2-way merge algorithm is introduced in the paper.
将内部缓冲技术、浮洞技术与分治技术相结合，提出了一种快速线性原地二路归并算法。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
应用推荐