Re:Big O, Little N
by formerly_proven on Friday October 02, 2020 @02:31PM
(#24665548)
Computational complexity theory is all about being very pedantic, and GP's conclusion is spot on.
[ Parent
| on HN ]
There are no comments on this comment yet.