Polish (Poland)English (United Kingdom)

Preprocessing Large Data Sets by the Use of Quick Sort Algorithm

Type of Publication: In Book Keywords: Computer algorithm – Data sorting – Data mining – Analysis of computer algorithms
Year: 2016
Editor: Skulimowski, M.J. Andrzej and Kacprzyk, Janusz
Volume: 364
Pages: 111-121
Publisher: Springer International Publishing
Address: Cham
Series: Advances in Intelligent Systems and Computing
ISBN: 978-3-319-19090-7
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.

We use cookies to improve our website and your experience when using it. Cookies used for the essential operation of the site have already been set. To find out more about the cookies we use and how to delete them, see our privacy policy.

I accept cookies from this site.