The present work shows the parallelization of the algorithmic design technique Divide & Conquer in two different ways: As a Parallel Design Pattern (PDP) through Active Objects and as Composition High-Level Parallel (HLPC). The overall purpose is to provide the user and novice programmer with two approaches within the object-oriented programming environment, particularly within the programming of Parallel Objects (PO), so that they can develop their programs according to a sequential programming style, automatically obtaining, easy and without much effort, the parallel counterpart of your code with the help of a specific programming environment like the one proposed. It is common for parallel applications to follow predetermined patterns in communication between processes. That is why this proposal proposes two different methods that solve problems with the same parallel control structure. Both methods use Structured Parallel Programming and Parallel Objects. The proposal is specialized in the algorithmic technique of divide & conquer to solve ordering, search, and optimization problems. The default pattern used to communicate problem solving processes is the tree structure. The proposed methods are novel because they offer the programmer the communication pattern between tree-like processes that is already defined in its structure. The programmer is only concerned with implementing the sequential algorithms that solve the problem under the divide & conquer paradigm. Both approaches are effective because they show good speedup analysis, and their usefulness, programmability, and performance are demonstrated.