Re:Researchers achieve ‘absurdly fast’ algorithm for network...
by magnio on Wednesday June 08, 2022 @10:41PM
(#31677066)
No. Any constant is in O(1), but not in o(1). Specifically, f=O(g) means f is (eventually) at most Cg for a certain C, but f=o(g) means f is (eventually) at most Cg for all C.
A useful, albeit not really rigorous, way to think about this is O is like ≤, while o is like <.
A useful, albeit not really rigorous, way to think about this is O is like ≤, while o is like <.