Exploiting partial order with Quicksort

DOI10.1002/SPE.4380140603MaRDI QIDQ3323281zbMATH OpenOpenAlexFDO

Authors R. Geoff Dromey

Publication date 1984

Published in Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://ro.uow.edu.au/compsciwp/46

zbMATH Keywords

internal sortingnearly sorted datapreconditioningQuicksortTransort

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Partial Quicksort and Quickpartitionsort
• Optimal sampling strategies for quicksort
• scientific article; zbMATH DE number 5556016
• Quicksort for Equal Keys
• Analysis of the performance of the parallel quicksort method

Cited in

(11)

• An optimal parallel adaptive sorting algorithm
• Splitsort -- an adaptive sorting algorithm
• Right invariant metrics and measures of presortedness
• A framework for adaptive sorting
• Partial Quicksort and Quickpartitionsort
• scientific article; zbMATH DE number 5556016 (Why is no real title available?)
• Randomized adaptive sorting
• Sorting shuffled monotone sequences
• A framework for adaptive sorting
• On partitions and presortedness of sequences
• On quickselect, partial sorting and multiple Quickselect

This page was built for publication: Exploiting partial order with Quicksort

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