|
| |
|
|
A102549
|
|
Optimal (best known) sequence of increments for shell sort algorithm.
|
|
2
| | |
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Values were found empirically. Better than A033622, A036562, A036564, A036569, and A055875.
|
|
|
REFERENCES
| Marcin Ciura, Best Increments for the Average Case of Shellsort, 13th International Symposium on Fundamentals of Computation Theory, Riga, Latvia, 22-24 August 2001; Lecture Notes in Computer Science 2001; Vol. 2138, pp. 106-117.
|
|
|
LINKS
| Marcin Ciura, Best Increments for the Average Case of Shellsort
|
|
|
CROSSREFS
| Cf. A033622, A036562, A036564, A036569, A055875.
Sequence in context: A200759 A137531 A159347 * A008258 A008251 A174934
Adjacent sequences: A102546 A102547 A102548 * A102550 A102551 A102552
|
|
|
KEYWORD
| hard,nonn
|
|
|
AUTHOR
| Gunther Piez (gpiez(AT)web.de), Feb 24 2005
|
|
|
EXTENSIONS
| a(8) = 1750 from Roman Dovgopol, May 08 2011
|
| |
|
|
