Does a nodelist contain circle?

Algorithm summary:

Determine whether a nodelist contains circle

1. The nodelist has no node, return 0

2. The nodelist has one node and the next field point to NULL return false

3. The nodelist has more than one nodes (at least two nodes)

1) define two point, P1 and P2, initially both point to head of the List;

2) Move P1 one step and P2 two steps each time, if the list has circle, P1 and P2 will point to the same node after several steps.

3) If P2 next field point to null after several steps, it indicates that there is no circle in the list.

Implement code

Code
1 Typedef Int Datatype;
2 Typedef Struct Node {
3 Datatype data;
4 Struct Nodelist * Next;
5 } Nodelist;
6
7 Int Iscircleinlist (nodelist * List ){
8 Linklist * P1 = List;
9 Linklist * P2 = List;
10 While (Node -> Next ! = Null && Node2 -> Next -> Next ! = Null)
11 {
12 P1 = Node -> Next;
13 P2 = Node2 -> Next -> Next;
14 If (P1 = P2) Return   1 ;
15 }
16
17 Return   0 ;
18