feat(permutations): clarify in README that the input integers will not repeat

Author: nik-rev

16_permutations/README.md

@@ -1,8 +1,11 @@
 # Exercise 16 - permutations
 
 Write a function that takes in an empty array or an input array of an consecutive positive integers, starting at 1, and returns an array of all possible permutations of the original array
+
+The integers will not repeat.
+
 ```javascript
-permutations([1,2,3]); // [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
+permutations([1, 2, 3]); // [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
 // An empty set has a single permutation, 0! = 1
 permutations([]); // [[]]
 ```