TAOCP 7.2.1.2 Exercise 16
Connection interrupted.
Section 7.2.1.2: Generating All Permutations
Exercise 16. [21] [21] Explain how to make Algorithm P run faster, by streamlining its operations when the value of j is near n. (This problem is analogous to exercise 1.)
Verified: no
Solve time: 3m16s
Connection interrupted. Waiting for the complete answer