aboutsummaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authorColin Okay <59481711+cbeo@users.noreply.github.com>2020-07-10 13:49:22 -0500
committerGitHub <noreply@github.com>2020-07-10 13:49:22 -0500
commitefe9a7d6f3670b1fa11a05d25ba6f79a917ec80d (patch)
treec08d2db34d192b5636f2cc485fd63baa2054270a
parentd4866a2de5578368ed69f0e439e2d176ba0714fc (diff)
rewording
-rw-r--r--README.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/README.md b/README.md
index 936ff99..106ec38 100644
--- a/README.md
+++ b/README.md
@@ -580,9 +580,9 @@ time. It is a good example of the usefulness of `inflate!`.
The basic flow is:
1. single out the first element of the vector
-2. generate permutations for the remainder of the vector
-3. return a generator that "adds back" the singled out element for
- each possible spot.
+2. make a generator for permutations of the remainder of the vector
+3. return a generator that "adds back" the singled out element at
+ each possible spot in each permutation.
The interesting bit about this is that we recursively compute
permutation generators for the subvectors of `vec` in a classic