Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    BIT 15 (1975), S. 85-93 
    ISSN: 1572-9125
    Keywords: internal sorting ; quicksort ; samplesort ; minimal-storage sorting ; tree-sort
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...