OFFSET
0,2
COMMENTS
LINKS
Marcin Ciura, Best Increments for the Average Case of Shellsort, in R. Freivalds, (ed.), Fundamentals of Computation Theory: 13th International Symposium, FCT 2001, Riga, Latvia, August 2001, Lecture Notes in Computer Science, vol. 2138, Springer, pp. 106-117.
EXAMPLE
a(0) = 1 performs a single pass of Shellsort with a gap size of 1 (which is identical to the Insertion Sort algorithm).
a(1) = 4 performs a single pass of Shellsort with a gap size of 4 (exchanging elements 4 positions apart if they are out of order).
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
Gunther Piez (gpiez(AT)web.de), Feb 24 2005
EXTENSIONS
a(8) = 1750 from Roman Dovgopol, May 08 2011
STATUS
approved