cp's OEIS Frontend

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.

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.

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.