Маргинальные свойства простых сортировок целочисленных массивов
17
The marginal properties of simple sorting
for integer arrays
© A.F. Deon, Yu.I. Terentiev
Bauman Moscow State Technical University, Moscow, 105005, Russia
The article presents a comparative analysis of marginal speed properties which was car-
ried out for simple sorting elements in integer arrays. We take into account the compari-
son, addition, transposition and saving operation.
Keywords:
sorting, speed, algorithm, integer numbers.
REFERENCES
[1] Knuth D. E.
The Art of Computer Programming
.
Vol. 3. Sorting and Searching
,
2009, 824 p.
[2] Sedgewick R.
Algorithms in C++. Parts 1–4. Fundamentals, Data Structures,
Sorting, Searching
, 2002, 688 p.
[3] Deon A.F., Terentiev Yu.I.
Inzhenernyi zhurnal: nauka i innovatsii - Engineer-
ing Journal: Science and Innovation
, 2013, no. 6(18). Available at:
http:/engjournal.ru/catalog/it/hidden/769.html.
Deon A.F.
(b. 1951) graduated from Bauman Moscow Higher Technical School in 1974.
Ph.D., Assoc. Professor of the Software and Information Technologies Department of
Bauman Moscow State Technical University. Author of 32 scientific works. The area of
interest is the software development for computer control systems.
e-mail:
Terentiev Ju.I.
(b. 1948) graduated from Bauman Moscow Higher Technical School in
1974. Ph.D., Assoc. Professor of the Software and Information Technologies Department
of Bauman Moscow State Technical University. Author of 40 scientific works. The area
of interest is the software development for computer simulation of physical warm pro-
cesses. e-mail:
