<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Cycle detection - Page 15 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=cycle_detection&amp;p=14">1.Previous</a><br />
<a accesskey="3" href="page.php?w=cycle_detection&amp;p=16">3.Next</a>
</p>
<p>the sequence at different speeds. It is also called the "tortoise and the hare algorithm", alluding to Aesop's fable of <a href="page.php?w=The_Tortoise_and_the_Hare">The Tortoise and the Hare</a>.</p>

<p>The algorithm is named after <a href="page.php?w=Robert_W._Floyd">Robert W. Floyd</a>, who was credited with its invention by <a href="page.php?w=Donald_Knuth">Donald Knuth</a>. However, the algorithm does not appear in Floyd's published work, and this may be a misattribution: Floyd describes algorithms for listing all simple cycles in a <a href="page.php?w=directed_graph">directed graph</a></p><p>
<a accesskey="1" href="page.php?w=cycle_detection&amp;p=14">1.Previous</a><br />
<a accesskey="3" href="page.php?w=cycle_detection&amp;p=16">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
