COMBINED SORTING ALGORITHMS
DOI:
https://doi.org/10.34185/1991-7848.itmm.2023.01.072Keywords:
algorithm, sorting, time efficiency, combined algorithm, preprocessing.Abstract
This study represents the usage of data preprocessing for performance improvement of sorting algorithms. Combining of different basic sorting algorithms was already successfully used to outperform any sole algorithm. The purpose of this research is to discover and estimate different ways to reorganize unsorted data just before executing the main sorting algorithm. Five preprocessing technics were developed and tested in combination with cocktail sort, insertion sort and quick sort. Time efficiency was estimated by comparing time of sole sorting algorithm and combined algorithm which includes preprocessing. Further studying of preprocessing methods and their impact on different sorting algorithms is required.
References
Bicomponent sorting algorithms / V I Shynkarenko, A. Y. Doroshenko, O. A. Yatsenko, V. V. Raznosilin, K. K. Halanin // The problems of programming — 2022. — № 3-4. —
P. 32-41
The Flashsort1 Algorithm / Karl-Dietrich Neubert.
URL: https://www.neubert.net/Flapaper /9802n.htm [Accessed: 3rd February 2023]
Introsort – C++’s Sorting Weapon /URL: https://www.geeksforgeeks.org/introsort-cs-sorting-weapon/ [Accessed: 10th February 2023]
