login
A204772
"Fairly optimal" shellsort sequence for reverse-sorting an ascending sequence of size N=128.
3
1, 4, 16, 76, 120, 127
OFFSET
1,2
COMMENTS
This is a fairly optimal sequence for reverse-sorting an ascending list where N = 128. Requires 4.875*N comparisons. 4.875 is approximately equal to 2.31*log_10(128). The operation performed requires a defined, substantial and certainly nontrivial amount of work which is repeatable for a list of any size.
FORMULA
Determined empirically.
CROSSREFS
Sequence in context: A101205 A301577 A324171 * A050540 A346662 A094559
KEYWORD
nonn,fini,full
AUTHOR
Olof Forshell, Jan 22 2012
STATUS
approved