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. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1007/978-3-319-46254-7_27 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Computer algorithm,Data sorting,Data mining,Analysis of computer algorithms | Data set,Hybrid algorithm,Merge sort,Computer science,Adaptive sort,In-place algorithm,Algorithm,Recursion,Sorting algorithm | Conference |
Volume | ISSN | Citations |
639 | 1865-0929 | 7 |
PageRank | References | Authors |
0.51 | 19 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zbigniew Marszalek | 1 | 31 | 5.95 |