Let f(n) = average number of comparisons needed for sorting n elements using merge insertion. Sequence gives n!*f(n).
A117628
Let f(n) = average number of comparisons needed for sorting n elements using merge insertion. Sequence gives n!*f(n).
Terms
- a(0) =0a(1) =2a(2) =16a(3) =112a(4) =832a(5) =6912a(6) =62784a(7) =623232
External references
- oeis: A117628