title: Checking if the linked list is circular
body: <p>I was just reading about tortoise and hare (slow and fast runner) algorithm <a href="http://www.programmerinterview.com/index.php/data-structures/how-to-find-if-a-linked-list-is-circular-or-has-a-cycle-or-it-ends/" rel="nofollow">here</a>, but I don't really understand why it's considered the best solution.</p>
  
  <p>Wouldn't it be less time consuming to do this: </p>
  
  <ul>
  <li><p>save root node</p></li>
  <li><p>travel through the linked list</p></li>
  <li><p>at each new node, check if it's the root node. </p></li>
  </ul>