Implementation of samplesort: A minimal storage tree sort

DOI10.1007/BF01932999MaRDI QIDQ4055240zbMATH OpenFDO

Authors Joseph G. Peters, Pieter Kritzinger

Publication date 1975

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01932999

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20)

Cites work

• Fourier Analysis of Uniform Random Number Generators
• Increasing the efficiency of quicksort
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Cited in

(1)

• Recursive samplesort

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Implementation of samplesort: A minimal storage tree sort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055240)