ABSTRACT
The resolution model by division of the considered problem can be specified, an equation whose solution gives the temporal complexity of the solution can be derived, and a code can be produced by means of such a construction. This methodological approach thus allows to proceed step by step and to design an algorithm that is “safe by construction”. The temporal complexity of a Divide and Conquer (DaC) algorithm is expressed as a function of one elementary operation appearing in the instance of the division model. The DaC approach is an essential brick in the arsenal of methods available to computer scientists.
