Macro-operations extraction out of computation process array sorting data

O.N. Paulin, N.O. Komlevaya, S.U. Marulin

Abstract


The paper dwells computation process (CP) array sorting from the simple to the efficient. Computation process present’s as a block flowchart for clarity. Each process are extracted macro operations (MO), which are functionality finished pieces of CP. Lists of MO for each sorting algorithm put it together and summarized – minimizing number of MO. This approach will allow careful consideration most CP as it applies to dedicated MO.

Problems in programming 2016; 2-3: 87-95


Keywords


sorting algorithm; computation process; flowchart; macro operations

References


Knuth, D. (2000) The Art of Computer Programming, 3: Sorting and Searching, Addison-Wesley Professional.

Liubchenko, V. (2006) About of the problem creating a model of parallel computing. Proceedings of the Third International Conference "Parallel Computations and Control Problems - PACO'2006». p. 1359-1374.

Kotov, V. (1984) Petri Nets. Science.

Paulin, O. (2015) Presentation of Petri nets computational processes. SWorld. V4(41). Т 2. p. 64–70.

Paulin, O. & Komlevaya, N. & Marulin, S. (2015) About computational processеs control. Modern information and electronic technologies 2016.

McConnell, J. (2007) Analysis of Algorithms: An Active Learning Approach, 2nd edn. Jones and Bartlett Publishers Inc.




DOI: https://doi.org/10.15407/pp2016.02-03.087

Refbacks

  • There are currently no refbacks.