(a, i, j)
| 1 | // https://leetcode.com/problems/next-permutation/description/ |
| 2 | |
| 3 | const swap = (a, i, j) => { |
| 4 | const t = a[i]; |
| 5 | a[i] = a[j]; |
| 6 | a[j] = t; |
| 7 | }; |
| 8 | |
| 9 | const sort = (a, i) => { |
| 10 | for (; i < a.length; i += 1) { |
no outgoing calls
no test coverage detected