Floyd Loop Detection Algorithm

The following algorithms helps you detect a cycle or loop. In this example we will be using Linked List Data structure to find if theres a loop in the linked list.
The following 'has_cycle'function return 1 if there is a loop else returns 0.


bool has_cycle(SinglyLinkedListNode* head) {
    SinglyLinkedListNode *slow=head,*fast=head;
    if(!head){
        return 0;
    }
    while(fast && fast->next){
        slow=slow->next;
        fast=fast->next->next;
        if(slow==fast){
            return 1;
        }
    }
    return 0;
}