A Comparison of the Execution Efficiency of a Reference and Move Sorting of Structured Data in a C# Application Methods

Abstract

Each method with an implemented arbitrary sorting algorithm during the realization of sorting of data stored, e.g., in a 2-dimensional unordered array must manipulate with this unordered data. During sorting, the method can move the rows of such array, it carries out a move sorting, or it can only move references to these rows, it carries out a reference sorting, when the method does not move the rows of the array, it does not manipulate with them at all. The way of dealing with data that are sorting can significantly affect the execution and memory efficiency of the sorting method. Using the methods of the C# application created by us, we have examined which of the mentioned ways of dealing with sorting data is more execution efficient. The paper contains comparisons of the execution efficiency of the methods of our C# application with the implemented move and reference sorting, the evaluation of the results of these comparisons, and also a brief description of the important sorting methods of this C# application.