Quicksort for Equal Keys

DOI10.1109/TC.1985.5009387MaRDI QIDQ3219784zbMATH OpenFDO

Authors Lutz Michael Wegner

Publication date 1985

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1985.5009387

zbMATH Keywords

algorithmsmultisetQuicksortsorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Sorting multisets stably in minimum space
• Quicksort is optimal for many equal keys
• Sorting multisets stably in minimum space
• Improving multikey Quicksort for sorting strings with many equal elements
• Stable in situ sorting and minimum data movement

Cited in

(11)

• A generalized, one-way, stackless quicksort
• Stable minimum space partitioning in linear time
• Sorting multisets stably in minimum space
• Probabilistic analysis of algorithms for the Dutch national flag problem
• Exploiting partial order with Quicksort
• Quicksort revisited
• scientific article; zbMATH DE number 4003539 (Why is no real title available?)
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• Sorting multisets stably in minimum space
• Quicksort is optimal for many equal keys
• Improving multikey Quicksort for sorting strings with many equal elements

This page was built for publication: Quicksort for Equal Keys

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