Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Floyd's_cycle-finding_algorithm
gptkb:Tortoise_and_Hare_algorithm |
| gptkbp:application |
cryptography
functional programming detecting infinite loops finding start of cycle in linked list |
| gptkbp:approach |
uses two pointers moving at different speeds
|
| gptkbp:category |
graph algorithms
pointer algorithms |
| gptkbp:complexity |
O(n)
|
| gptkbp:cycleDetectedWhen |
tortoise and hare pointers meet
|
| gptkbp:describedBy |
gptkb:Communications_of_the_ACM
|
| gptkbp:describedYear |
1967
|
| gptkbp:harePointer |
moves two steps at a time
|
| https://www.w3.org/2000/01/rdf-schema#label |
Floyd Loop
|
| gptkbp:inventedBy |
gptkb:Robert_W._Floyd
|
| gptkbp:spaceComplexity |
O(1)
|
| gptkbp:tortoisePointer |
moves one step at a time
|
| gptkbp:usedFor |
cycle detection in linked lists
cycle detection in sequences |
| gptkbp:bfsParent |
gptkb:Bernadine_Healy
|
| gptkbp:bfsLayer |
5
|