Floyd’s cycle-finding algorithm

E1119494 UNEXPLORED

Floyd’s cycle-finding algorithm is a classic pointer-based technique in computer science for detecting cycles in sequences or linked structures using two iterators moving at different speeds.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Floyd’s cycle-finding algorithm canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Robert W Floyd → notableWork → Floyd’s cycle-finding algorithm ⓘ

subject surface form: Robert W. Floyd