On the average‐case complexity of Shellsort

We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new res...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 52; no. 2; pp. 354 - 363
Main Author:	Vitanyi, Paul
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 01.03.2018
Subjects:	average‐case complexity Complexity Inversions Kolmogorov complexity lower bound Lower bounds Shellsort
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!