On Wednesday, 30 April 2014 at 11:35:56 UTC, Ola Fosheim Grøstad
wrote:
On Wednesday, 30 April 2014 at 11:24:09 UTC, Dicebot wrote:
For algorithms execution complexity is not a mere
implementation detail. "walk' implies exactly that it is O(n)
as opposed to O(1) of built-in length properties. It is a wise
approach.
For you maybe. For me the response is "walkLength???" WTF is
that? Does this imply a length restricted forEach?
And that would have been quite a close guess actually as
walkLength is constrained to accept only finite InputRanges :)
"walk" here implies iteration and iteration implies O(n).
