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?

I've never seen "walk" or "traverse" being used for indicating O(n), it is usually used to indicate something you can utilize in order to traverse a data-structure. That's how the terms are used in CS.

"Walk" is an imperative. "walk length" indicates "walk the length of", not "calculate the length of".

But naming functions is often more difficult than writing the code. (not a joke)

Reply via email to