Sorting algorithms find their application in many fields. One of their
main uses is to organize databases. Classical applications of sorting
algorithms often can not cope satisfactorily with large data sets
or with unfavorable poses of sorted strings. Typically, in such situations,
we try to use other methods or apply sorting process to reshuffled
input data. Unfortunately, this approach complicates sorting process
and often results in significant prolongation of the time. In this
paper, the authors examined an algorithm dedicated to the problem
of sorting large scale data sets. In the literature, there are no
studies of such examples. These studies will allow to describe the
properties of sorting methods for large scale data sets. Performed
tests have shown superior performance of the examined algorithm,
especially for large scale data sets. Changes sped up sorting of
data with any arrangement of the input elements.

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.