Optimal Solutions to the Sort Algorithms of Database Structure
AbstractSorting is much used in massive data applications, insurance systems, education, health, business, etc. To the sorting operation that sorts the data as desired, quick access to the required data is achieved. Typically sorted data are organized in strings as file elements or tables. The most common case is when the tabular data is processed in the main memory of the computer. The paper presents the algorithms currently used for sorting objects that are involved in static and dynamic data structures. Then the selection of the data set on which particular algorithms will be applied will be made and the advantages and disadvantages of each of the algorithms in question will be seen.Thereafter, it is determined the efficiency of the sorting algorithm work and it is considered what is determinative when selecting the appropriate algorithm for sorting.
Jan 1, 2020
How to Cite
OSMANAJ, Rifat; BINJAKU, Hysen. Optimal Solutions to the Sort Algorithms of Database Structure. European Journal of Education, [S.l.], v. 3, n. 1, p. 40-50, jan. 2020. ISSN 2601-8624. Available at: <http://journals.euser.org/index.php/ejed/article/view/4594>. Date accessed: 03 apr. 2020. doi: http://dx.doi.org/10.26417/ejed.v3i1.p40-50.