Improving multikey Quicksort for sorting strings with many equal elements

DOI10.1016/J.IPL.2009.01.007zbMATH1209.68173DBLPjournals/ipl/KimP09OpenAlexW2055710796WikidataQ29999072MaRDI QIDQ987791FDOQ987791

Authors Eunsang Kim, Kunsoo Park

Publication date 16 August 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.01.007

zbMATH Keywords

algorithmsstring sortingmultikey Quicksortternary partitioning

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 5989955
• Quicksort for Equal Keys
• Quicksort is optimal for many equal keys
• Multikey quickselect
• How good is multi-pivot quicksort?

Cites work

• scientific article; zbMATH DE number 5989955 (Why is no real title available?)
• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• Implementing Quicksort programs
• Programming as a Discipline of Mathematical Nature
• Quicksort
• Quicksort with Equal Keys

Cited in

(3)

• Multikey quickselect
• Quicksort for Equal Keys
• scientific article; zbMATH DE number 5989955 (Why is no real title available?)

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Improving multikey Quicksort for sorting strings with many equal elements

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