📚 docs(build): Add link to original paper.

Author: make-github-pseudonymous-again

src/build.js

@@ -2,6 +2,11 @@
  * Computes for each j the largest 0 <= i < j such that
  * p.slice(0, i) is p.slice(j-i, j).
  *
+ * This is the "f[j]" table found in
+ * "Fast pattern matching in strings" by Knuth, Morris, and Pratt,
+ * although here indices are 0-based hence all indices and inputs are one less
+ * than in that paper.
+ *
  * @param {ArrayLike} p
  * @param {number} pi
  * @param {number} pj