ISSN:
1572-9125
Schlagwort(e):
internal sorting
;
quicksort
;
samplesort
;
minimal-storage sorting
;
tree-sort
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Abstract An implementation of samplesort, a generalization of minimal-storage tree-sorting, is presented as an algorithm which is relatively insensitive to possible non-random permutations of the elements to be sorted. A brief analytical discussion and the results of extensive empirical tests are included. It is claimed that with the particular choice of samplesize, samplesort is probably one of the most efficient, if not the most efficient sorting algorithm known.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01932999
Permalink