A space efficient distributive sort

DOI10.1016/0020-0190(91)90137-7zbMATH Open0724.68046OpenAlexW1964886423MaRDI QIDQ758207FDOQ758207

Authors C. C. Handley

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90137-7

zbMATH Keywords

distributive sort

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• An Internal Hybrid Sort Algorithm Revisited
• Sorting multisets stably in minimum space
• An analysis and implementation of an efficient in-place bucket sort
• Analyzing a class of distributive partitioning sort algorithms
• In-place linear probing sort

Cites work

• An Adaptive Method for Unknown Distributions in Distributive Partitioned Sorting
• Implementing Quicksort programs
• Sorting by distributive partitioning
• Sorting in linear expected time
• Sorting numbers in linear expected time and optimal extra space
• Usort: An efficient hybrid of distributive partitioning sorting

Cited in

(2)

• scientific article; zbMATH DE number 2247679 (Why is no real title available?)
• An Internal Hybrid Sort Algorithm Revisited

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: A space efficient distributive sort

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