The theory of
decomposition schemes offer a typology of algorithms for the first time in
software engineering. The typology allows us to represent the field of
algorithms in the form of a system similar to the periodic table of chemical
elements.
The typology
allows to divide the field of algorithms into groups of algorithms.
Within group comparisons of algorithms and their generalization becomes
systematic and methodical work. At the same time this work remains quite
difficult the work of research. Analysis algorithms performed in groups more
effectively than any analysis on the entire field of algorithms.
Twelve groups of
algorithms are known currently. These
groups are due to the storage and processing of information in the computer. However,
a set of groups of algorithms due to the structure of the decomposition schemes
is large enough and has not yet investigated. Actually, it is a typology of
decomposition schemes. It is difficult to say how many such groups the decomposition
schemes. Although the direction in which to move in order to create a set of
decomposition schemes types is known.
A set of
algorithms types does not correspond with the set of currently existing set of
application areas. If I may say so, a set of algorithms types and a set of
application areas is correlated slightly.
No comments:
Post a Comment