A short and precise algorithm for determining a module initialization order in modular programming languages is described. This algorithm is compared with a classical technique of dependency analysis of module names. It is also shown how an algorithm for determining a module compilation order is drawn from a given algorithm.