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

Still curious? Ask our experts.

Chat with our AI personalities

RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
RossRoss
Every question is just a happy little opportunity.
Chat with Ross

Add your answer:

Earn +20 pts
Q: Big o in mathematic
Write your answer...
Submit
Still have questions?
magnify glass
imp