Aaaand it's wrong like 99.9% other explanations: f(n)=O(n^2) is actually NOT f(n) asymptotically grows as fast as n^2, it is f grows “no faster” than n^2. “As

Aaaand it's wrong like 99.9% other explanations: f(n)=O(n^2) is actually NOT f(n) asymptotically grows as fast as n^2, it is f grows “no faster” than n^2. “As fast as” is f(n)=Θ(n^2) Edit: oh, and Big-O is not “a relative representation of the complexity of an algorithm”