Rookie playing algorithms data structures and algorithms · · · Complexity of the two big O notation

concept

    If there is a positive number n and N, as n>Nwhen there f(n) < mg(n)is f(n) = O(g(n)). The described method mainly on article mentioned progressive complexity of representation, is the 1894 Nian Paul Bachmann raised.

Published 173 original articles · won praise 24 · views 50000 +

Guess you like

Origin blog.csdn.net/CSS360/article/details/104348050