Total number of swaps needed to sort all n! permutations of n elements by the optimal dual-pivot quicksort "Count".
A334750
Total number of swaps needed to sort all n! permutations of n elements by the optimal dual-pivot quicksort "Count".
Terms
- a(0) =0a(1) =0a(2) =4a(3) =16a(4) =103a(5) =711a(6) =5526a(7) =48066a(8) =463248a(9) =4908816a(10) =56749536a(11) =711299232a(12) =9609618816a(13) =139252708224
External references
- oeis: A334750