Floyd Cycle Detection Algorithm | Algorithm | Visualization, Code, Example

[@HussainAbdi_]

Nice visualisation! It would be useful to have an explanation for why the slow pointer will always catch up to a fast pointer if in a cycle, as well as edge/different cases like C1: starting on a non-cycle node vs. C2: starting on a cycle node. Within C1 also the case of 1 node before cycle, even num of nodes before cycle, odd num of nodes before cycle. Not sure if these are all relevant test cases, but definitely worth adding more explanation on completeness for future videos! Keep creating!

[@ygongcode]

Thanks for the feedback. You bring up good points, I’ll keep them in mind. It is also an act of trade-off of how deep I want to go. For example, proving the algorithm correctness will add a fair length to the video and might cater to a more specific set of audience.

[@HussainAbdi_]

​@@ygongcode Yup, that makes sense! What's your vision for the channel?