Abstract. Sorting algorithms are important procedures to facilitate the
order of data. Classic versions of algorithms often can not efficiently determine
the correct order in large scale data sets. In this article, authors
describe and examine an extended heap sort algorithm performance for
large data sets. Extension of the heap structure was subject to performance
tests, that showed validity. With the extension, algorithm is able
to sort incoming strings faster, regardless to the arrangement of incoming
data.
Keywords: computer algorithm, data sorting, data mining, analysis of
computer algorithms