Orbits
summary
Implements Floyd's cycle-finding on a 1–98 linked list, then manually links node 80 to node 22 and runs the detector; program prints “list 1 to 98”, then “loop started at 22”, computes handle size and circle size as 21 and 58, and derives the connection point from a single collision. Uses a short C++ demo (code on the GitHub slide repo) built and executed live, illustrating algebraic decomposition of transformations and a working loop-finder instead of language-specific trickery.
AI-written summary · about
related talks
46mC++ Fundamentals - Algorithms
47mFantastic Algorithms and Where To Find Them
51mLittle Red Riding Hood & the k-d tree forest
20mMisconceptions About Loops in C
01h 04mBetter Code: Data Structures
01h 25mNew Algorithms in C++23
01h 02mDiscovering a User-Facing Concept
01h 01mAlgorithm Intuition (part 2 of 2)