detect a loop in linked list using slow and fast pointer

linkedListCycle.java

boolean hasCycle(Node head) {
    boolean result = false;

    if (head == null) {
        result = false;
    }
    else {
        Node slowp = head;
        Node fastp = head;
        while (fastp != null && fastp.next != null && slowp != null) {
            slowp = slowp.next; //increment by 1
            fastp = fastp.next.next; //increment by 2 
            if (slowp == fastp) {
                //cycle detected
                result = true;
                break;
            }
        }
    }
    return result;
}