Introspective sorting and selection revisited

DOI10.1002/(SICI)1097-024X(200005)30:6%3C617::AID-SPE311%3E3.0.CO;2-AMaRDI QIDQ4789089zbMATH OpenOpenAlexWikidataFDO

Authors John D. Valois

Publication date 23 January 2003

Full work available at URL https://doi.org/10.1002/(sici)1097-024x(200005)30:6%3C617::aid-spe311%3E3.0.co;2-a

zbMATH Keywords

quicksortsorting and selection algorithmsgeneric algorithmsfindhybrid algborithmsintrospective algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Randomized adaptive sorting
• Computational Science – ICCS 2005
• A select and insert sorting algorithm
• Worst-case efficient sorting with QuickMergesort
• Optimal sampling strategies for quicksort

Cited in

(3)

• Sorting versus screening: search frictions and competing mechanisms
• STRONGER QUICKHEAPS
• On Floyd and Rivest's SELECT algorithm

This page was built for publication: Introspective sorting and selection revisited

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