A205670 Possibly optimal shellsort sequence for reverse-sorting an ascending list of size N=32.

1, 4, 20, 31

Offset

1,2

Comments

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

References

Sequences A204772 where N=128 and A205669 where N=64.

Links

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

Crossrefs

Sequence in context: A317249 A181433 A079454 * A115428 A172624 A043880

Adjacent sequences: A205667 A205668 A205669 * A205671 A205672 A205673

Keyword

nonn

Author

Olof Forshell, Jan 30 2012

Status

approved