Macro-operations extraction out of computation process array sorting data
Author(s) -
О. М. Паулін,
Nataliia Komleva,
Stanislav U. Marulin
Publication year - 2016
Publication title -
problems in programming
Language(s) - English
Resource type - Journals
ISSN - 1727-4907
DOI - 10.15407/pp2016.02-03.087
Subject(s) - sorting , macro , flowchart , computation , computer science , process (computing) , block (permutation group theory) , clarity , simple (philosophy) , algorithm , mathematics , programming language , biochemistry , chemistry , philosophy , geometry , epistemology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom