Talk:Cycle detection: Difference between revisions
Content added Content deleted
(output follow-up) |
(Performance? really?) |
||
Line 15: | Line 15: | ||
I would prefer that it use Brent, since that makes it easier for those who might benefit from the algorithm to make an apples-to-apples comparison when looking at different language implementations. At the very least the implementer should identify which algorithm they are using. The performance characteristics can vary considerably among algorithms. |
I would prefer that it use Brent, since that makes it easier for those who might benefit from the algorithm to make an apples-to-apples comparison when looking at different language implementations. At the very least the implementer should identify which algorithm they are using. The performance characteristics can vary considerably among algorithms. |
||
--[[User:Paul.chernoch|Paul.chernoch]] ([[User talk:Paul.chernoch|talk]]) 22:52, 26 February 2016 (UTC) |
--[[User:Paul.chernoch|Paul.chernoch]] ([[User talk:Paul.chernoch|talk]]) 22:52, 26 February 2016 (UTC) |
||
: When performance is critical it's probably best to not use an algorithm which uses O(1) space. (On the other hand, performance is usually not critical.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 16:15, 3 March 2016 (UTC) |