|
Search: id:A102549
|
|
|
| A102549 |
|
Optimal (best known) sequence of increments for shell sort algorithm. |
|
+0
2
|
| |
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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: A118645 A137531 A159347 this_sequence A008258 A008251 A083168
Adjacent sequences: A102546 A102547 A102548 this_sequence A102550 A102551 A102552
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Gunther Piez (gpiez(AT)web.de), Feb 24 2005
|
|
|
Search completed in 0.002 seconds
|
