A heuristic approximation of the worst case of Shellsort

DOI10.1007/BF01933185zbMath0428.68071OpenAlexW1968490376MaRDI QIDQ3865497

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 optimizationworst case analysisheuristic approximationshellsortinternal sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (1)

A heuristic approximation of the worst case of Shellsort

Cites Work

• Unnamed Item
• An empirical study of minimal storage sorting
• A heuristic approximation of the worst case of Shellsort
• A statistical approach to the tsp

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