iv class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="comment">// The complexity of this algorithm is O(n . alpha(n)) where alpha(n) is</span></div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="comment">// the inverse Ackermann function. alpha(n) &lt;= log(log(log(..log(log(n))..)</span></div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;<span class="comment">// In practice alpha(n) &lt;= 5.</sp