Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures

DOI10.1007/978-1-84882-912-1_11MaRDI QIDQ3163407zbMATH OpenOpenAlexFDO

Authors David Kitchin, Adrian Quark, Jayadev Misra

Publication date 26 October 2010

Published in Reflections on the Work of C.A.R. Hoare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-84882-912-1_11

zbMATH Keywords

concurrencymutabilityrecursion

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• Quicksort revisited
• Multi-pivot quicksort: theory and experiments
• Resilient quicksort and selection
• QuickHeapsort, an efficient mix of classical sorting algorithms
• scientific article; zbMATH DE number 1629853
• QuickXsort: a fast sorting scheme in theory and practice
• scientific article; zbMATH DE number 1375579
• Quicksort asymptotics

Cited in

(3)

• A one-way, stackless quicksort algorithm
• Executable rewriting logic semantics of Orc and formal analysis of Orc programs
• Quicksort revisited

Describes a project that uses

Uses Software

• Orc

This page was built for publication: Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures

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