The Struggle against Complexity of the Algorithms

Early methods of manual labor savings in programming

Programming tools	Saving method	Text fragment represented by	Realization. Moment produce the effect
Assembler	Macro	Assembler	Preprocessing
Algorithmic language	Macro	Its own language	Preprocessing
Algorithmic language	Operator of algorithmic language	Machine code	Translation
Assembler or algorithmic language	subroutine	Machine code	Assembling or computer working

These methods make it possible to reduce and save the amount of text written by hand. These methods make it possible to compress and hide fragments of the text, and later retrieve them using the identifier.

Early methods of saving hid linear fragments of the text or code. But always remained a deeper problem - it is to compress and hide the complexity of the algorithm. This problem requires the same resolution in the software industry today.

The theory of the decomposition scheme solves this problem - compresses and hides complexity. The theory of the decomposition scheme allows you to compress and hide control - loops, conditional statements, alternatives, and subroutine calls, rather than fragments of the text or code.