The marginal properties of simple sorting for integer arrays
Published: 18.11.2014
Authors: Deon A.F., Terentiev Yu.I.
Published in issue: #11(35)/2014
DOI: 10.18698/2308-6033-2014-11-1309
Category: Information technology
The article presents a comparative analysis of marginal speed properties which was carried out for simple sorting elements in integer arrays. We take into account the comparison, addition, transposition and saving operation.
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 - Engineering Journal: Science and Innovation, 2013, no. 6(18). Available at: http://engjournal.ru/catalog/it/hidden/769.html