Execution Efficiency of the Use of Language-Integrated Queries in a C# Application

Abstract

In many applications, the programmer has to implement various searching and sorting algorithms. These algorithms often perform more complex searching and sorting, e.g. they search for students in their list according to the range of points for an accommodation that they have achieved. In these groups, these algorithms sort students according to these points or the last name. Such searching and sorting can be done using the sorting and searching methods of the application, without using language-integrated queries, or by using these queries. We were interested in, which of these ways of searching and sorting is more execution efficient and more suitable for mentioned searching and sorting, especially in bigger data sets, e.g. in 2000-item students datasets, in an application created in C#. The results of the experiment, in which we examine the execution efficiency of sorting and group search using searching and sorting methods and the source code of the application without using language-integrated queries, and by using these queries, are presented in the paper.