Linked List detection experiment

Floyds Linked List Algorithm

#taken from Floyds Algorithm (http://en.wikipedia.org/wiki/Cycle_detection#Tortoise_and_hare)
def floyd(f, x0)
    tortoise = f(x0)
    hare = f(f(x0))
    while tortoise != hare
        tortoise = f(tortoise)
        hare = f(f(hare))
    end

    mu = 0
    tortoise = x0
    while tortoise != hare
      tortoise = f(tortoise)
      hare = f(hare)
      mu += 1
    end
    
    lam = 1
    hare = f(tortoise)
    while tortoise != hare 
      hare = f(hare)
      lam += 1
    end

    lam == mu
end