Hacker News new | ask | show | jobs
by ShamelessC 2396 days ago
Isn't this just calculating the cyclomatic complexity?
1 comments
ralmeida 2396 days ago
No - OP meant computationally expensive, not cognitively expensive. Two nested for-loops can be O(nˆ2) but can have a cyclomatic complexity as low as 1.
link