Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2'.
A079750
Operation count to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of comparisons required to find j in step L2.2'.
Terms
- a(0) =0a(1) =4a(2) =25a(3) =156a(4) =1099a(5) =8800a(6) =79209a(7) =792100a(8) =8713111a(9) =104557344a(10) =1359245485a(11) =19029436804a(12) =285441552075
External references
- oeis: A079750