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

15y ago

Still curious? Ask our experts.

Chat with our AI personalities

JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
ReneRene
Change my mind. I dare you.
Chat with Rene

Add your answer:

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