Fixed the error in the number sequence. Have not implemented example …

…formula yet. Will address later. Addressing issue RunestoneInteractive#70, I am a Berea college student.
WhitfordR · Sep 18, 2019 · 80d14ea · 80d14ea
1 parent 4f25c49
commit 80d14ea
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 1 deletion.
diff --git a/_sources/SortSearch/Hashing.rst b/_sources/SortSearch/Hashing.rst
@@ -328,7 +328,7 @@ in our examples.
 
 A variation of the linear probing idea is called **quadratic probing**.
 Instead of using a constant “skip” value, we use a rehash function that
-increments the hash value by 1, 3, 5, 7, 9, and so on. This means that
+increments the hash value by 1, 4, 9, 16, 25, 36, and so on. This means that
 if the first hash value is *h*, the successive values are :math:`h+1`,
 :math:`h+4`, :math:`h+9`, :math:`h+16`, and so on. In other words,
 quadratic probing uses a skip consisting of successive perfect squares.

diff --git a/build_info b/build_info
@@ -0,0 +1 @@
+4.0.0-19-g4f25c49