3 ms·
It would seem that the author of the article is abusing the Big-O notation. When saying some operation is O(f(n)) they probably mean that the operation takes ex
by malaggan 10y ago
It would seem that the author of the article is abusing the Big-O notation. When saying some operation is O(f(n)) they probably mean that the operation takes exactly f(n) steps, rather than the usual meaning of asymptotic complexity.
- sweezyjeezy 10y agoThat's not true, O(f(n)) means at most f(n) up to a constant. If you wanted to say something took exactly f(n), surely you would just write f(n)...
- lorenzhs 10y agoNo, it means asymptotically equal to f(n). O(n^2 + n log n) = O(n^2), despite n log n not being a constant.