DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 1

V.G. Kolesnyk

Abstract


R-data kinds of division are described and factors of their fragments and components placing are considered. For all the variants of R-data division the changes into the canonic algorithm which are necessary for their union are described. From the standpoint of the complexity changes in algorithm vary from primitives in several imperative operators to algorithmic constructions with loops and control constructs. For making the algorithmic constructions there is the mechanism of synthesis offered – bound to the levels of algorithm tree. For purposes of the comparative analysis the schemes of decomposition and applied algorithm there was offered the notion of NAC-conditionality as more fitting that the graph isomorphism. It is shown that description of the variants and factors of R-data division is declarative.

Full Text:

PDF (Russian)

References


Колесник В.Г. DS-теория как прототип теории прикладных алгоритмов // Проблеми програмування. – 2012. – № 1. – С. 17–33.

Колесник В.Г. DS-теория. Представление канонического алгоритма с помощью алгоритмического языка // Проблеми програмування. – 2015. – № 1. – С. 3–18.

Jackson structured programming [Электронный ресурс] // http://en.wikipedia.org/wiki/ Jackson_structured_programming.

Сортировка слиянием [Электронный ресурс] // https://ru.wikipedia.org/wiki/ Сортировка_слиянием.


Refbacks

  • There are currently no refbacks.