A heuristic approximation of the worst case of Shellsort

DOI10.1007/BF01933185MaRDI QIDQ3865497zbMATH OpenOpenAlexFDO

Authors Hannu Erkiö

Publication date 1980

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01933185

zbMATH Keywords

combinatorial optimizationheuristic approximationinternal sortingshellsortworst case analysis

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• A heuristic approximation of the worst case of Shellsort
• A statistical approach to the tsp
• An empirical study of minimal storage sorting
• scientific article; zbMATH DE number 3141621 (Why is no real title available?)

Cited in

(1)

• A heuristic approximation of the worst case of Shellsort

This page was built for publication: A heuristic approximation of the worst case of Shellsort

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