An efficient external sorting with minimal space requirement

DOI10.1007/BF00996816MaRDI QIDQ4747522zbMATH OpenOpenAlexFDO

Authors Dalia Motzkin, Christina L. Hansen

Publication date 1982

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

efficient sortingexternal sortingquicksort

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A stable quicksort
• scientific article; zbMATH DE number 3635458 (Why is no real title available?)
• Increasing the efficiency of quicksort
• Quicksort with Equal Keys
• Stable Sorting and Merging with Optimal Space and Time Bounds
• The analysis of Quicksort programs

Cited in

(1)

• A disk-aware algorithm for time series motif discovery

Describes a project that uses

Uses Software

• Find
• Quicksort
• Algorithm 347

This page was built for publication: An efficient external sorting with minimal space requirement

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