Improving multikey Quicksort for sorting strings with many equal elements

DOI10.1016/J.IPL.2009.01.007zbMATH Open1209.68173DBLPjournals/ipl/KimP09OpenAlexW2055710796WikidataQ29999072 ScholiaQ29999072MaRDI 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

Recommendations

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

zbMATH Keywords

algorithmsstring sortingmultikey Quicksortternary partitioning

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Quicksort
• Title not available (Why is that?)
• Quicksort with Equal Keys
• Programming as a Discipline of Mathematical Nature
• Implementing Quicksort programs
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Multikey quickselect
• Quicksort for Equal Keys

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)