Sorting algorithms are important procedures to facilitate the order of data. In this paper, author describes new recursive version of fast sort algorithm for large data sets. Examination of the recursive fast sort algorithm performance was subject to performance tests, that showed validity. It is discussed, if non recursive version is faster than recursive.
CITATION STYLE
Marszałek, Z. (2016). Novel recursive fast sort algorithm. In Communications in Computer and Information Science (Vol. 639, pp. 344–355). Springer Verlag. https://doi.org/10.1007/978-3-319-46254-7_27
Mendeley helps you to discover research relevant for your work.