answersLogoWhite

0

Big O notation (also O()) describes the limiting behaviour of a function when the argument tends towards a particular value (most often we consider infinity) usually in terms of simpler functions. For example, the statement

: ; would imply that the function T has n2 time complexity - that is, it is upper bounded by the function n2.

User Avatar

Wiki User

16y ago

What else can I help you with?