Smoothsort's behavior on presorted sequences

DOI10.1016/0020-0190(83)90116-3MaRDI QIDQ1836983zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3527787 (Why is no real title available?)
• scientific article; zbMATH DE number 3614186 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Smoothsort, an alternative for sorting in situ

Cited in

(3)

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

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

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