Hi,<BR><BR>I'm trying to understand the tortoise and the hare algorithm used to detect loops in a linked list.<BR><BR>I can understand that they'll meet if there's a loop. But I don't really ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results