scientific article; zbMATH DE number 4003539

MaRDI QIDQ4728256zbMATH OpenFDO

Authors Branislav Ďurian

Publication date 1986

zbMATH Keywords

constant workspaceQuicksortsorting algorithms

Mathematics Subject Classification ID

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

Recommendations

• A generalized, one-way, stackless quicksort
• Quicksort revisited
• A one-way, stackless quicksort algorithm
• Quicksort for Equal Keys
• Sorting multisets stably in minimum space

Cited in

(9)

• A one-way, stackless quicksort algorithm
• A generalized, one-way, stackless quicksort
• Stable minimum space partitioning in linear time
• Sorting multisets stably in minimum space
• QuickHeapsort, an efficient mix of classical sorting algorithms
• Quicksort revisited. Verifying alternative versions of quicksort
• Quicksort revisited
• Sorting multisets stably in minimum space
• Stable in situ sorting and minimum data movement

This page was built for publication:

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