<p><pre><code>  &#62; doubling the size of the hash table whenever
  &#62; there are too many entries in it.
</code></pre>
And then re-hashing and dealing with all that implies.  Surely all of that is much harder than chasing a pair of pointers down the list.<p>Also, it doesn't work in the case of, say, Pollard's Rho method of factoring.  I really need to change the original article to make it clear that that's a case I'm interested in.