Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Floyd's_cycle-finding_algorithm
|
| gptkbp:alternativeTo |
Brent's algorithm
|
| gptkbp:approach |
two pointers
|
| gptkbp:category |
computer science
graph theory linked list algorithms |
| gptkbp:complexity |
O(n)
|
| gptkbp:cycleDetectedWhen |
tortoise and hare meet
|
| gptkbp:firstPublished |
1967
|
| gptkbp:hareMoves |
two steps at a time
|
| https://www.w3.org/2000/01/rdf-schema#label |
tortoise and hare algorithm
|
| gptkbp:inventedBy |
gptkb:Robert_W._Floyd
|
| gptkbp:pointer1 |
turtle
|
| gptkbp:pointer2 |
hare
|
| gptkbp:spaceComplexity |
O(1)
|
| gptkbp:tortoiseMoves |
one step at a time
|
| gptkbp:usedFor |
cycle detection
detecting cycles in sequences finding cycles in linked lists |
| gptkbp:bfsParent |
gptkb:Floyd's_cycle-finding_algorithm
|
| gptkbp:bfsLayer |
6
|