A205669 "Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=64.

1, 5, 24, 62

Offset

1,2

Comments

This is a fairly optimal sequence for reverse-sorting an ascending list where N = 64. Requires 4.125*N comparisons. 4.125 is approximately equal to 2.28*log_10(64). The operation performed requires a defined, substantial and certainly nontrivial amount of work which is repeatable for a list of any size.

References

Sequence A204772 where N=128.

Links

Table of n, a(n) for n=1..4.

Crossrefs

Sequence in context: A121546 A135703 A258290 * A101147 A274723 A006328

Adjacent sequences: A205666 A205667 A205668 * A205670 A205671 A205672

Keyword

nonn

Author

Olof Forshell, Jan 30 2012

Status

approved