Smoothsort's behavior on presorted sequences

DOI10.1016/0020-0190(83)90116-3zbMath0506.68048OpenAlexW2080764473MaRDI QIDQ1836983

Stefan Hertel

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90116-3

zbMATH Keywords

complexitysortingheapinversionspresortedness

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Right invariant metrics and measures of presortedness ⋮ On partitions and presortedness of sequences

Cites Work

• Smoothsort, an alternative for sorting in situ
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smoothsort's behavior on presorted sequences