What is an efficient algorithm to find whether a singly linked list is circular/cyclic or not? [duplicate]

Answer 1

A algorithm is:

1. Store the pointer to the first node
2. Traverse through the list comparing each node pointer to this pointer
3. If you encounter a NULL pointer, then its not circularly linked list
4. If you encounter the first node while traversing then its a circularly linked list