Floyd's tortoise and hare algorithm ( Cycle Detection)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O((\lambda + \mu)$ t_f) == Space Complexity == $O({1})$ Pointer algo (Algorithmic Cryptanalysis) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1967 == Reference == http://pds7.egloos.com/pds/200801/07/29/p636-floyd.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O((\lambda + \mu)$ t_f)

Space Complexity

$O({1})$ Pointer algo

(Algorithmic Cryptanalysis)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1967

Reference

http://pds7.egloos.com/pds/200801/07/29/p636-floyd.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Floyd%27s_tortoise_and_hare_algorithm_(_Cycle_Detection)&oldid=45280"