Novel recursive fast sort algorithm

15Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free