|
%I #12 Dec 07 2019 14:53:32
%S 1,4,20,31
%N Possibly optimal shellsort sequence for reverse-sorting an ascending list of size N=32.
%C 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.
%D Sequences A204772 where N=128 and A205669 where N=64.
%K nonn
%O 1,2
%A _Olof Forshell_, Jan 30 2012
| 