Osječki matematički list, Vol. 5 No. 1, 2005.
Stručni rad
Data sorting
A. Baumgartner
S. Poljak
Sažetak
In this paper one solution of the problem of sorting
an one-dimensional vector (array) of data is shown in this paper. A
need for data sorting very often arises in the practice and therefore we are constantly searching for more efficient and faster sorting
algorithms. One of the best sorting algorithms -merge-sort is
shown in this paper in detail. We made two of sorting
algorithms and tested them on different types of data.
Ključne riječi
sorting algorithms; merge-sort; recursive algorithms
Hrčak ID:
4056
URI
Datum izdavanja:
20.8.2005.
Posjeta: 11.643 *