Name
Abstract | ||
|---|---|---|
Sorting algorithms help to organize large amounts of data. However, sometimes it is not easy to determine the correct order in large data sets, especially if there are special poses on the input. It often complicates sorting, results in time prolongation or even unable sorting. In such situations, the most common method is to perform sorting process to reshuffled input data or change the algorithm. In this paper, the authors examined quick sort algorithm in two versions for large data sets. The algorithms have been examined in performance tests and the results helped to compare them. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-19090-7_9 | KICSS |
Keywords | DocType | Volume |
Computer algorithm,Data sorting,Data mining,Analysis of computer algorithms | Conference | 364 |
ISSN | Citations | PageRank |
2194-5357 | 12 | 0.62 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcin Wozniak | 1 | 223 | 38.18 |
| Zbigniew Marszalek | 2 | 31 | 5.95 |
| Marcin Gabryel | 3 | 120 | 13.63 |
| Robert K. Nowicki | 4 | 12 | 0.62 |