go to  ForumEasy.com   
JavaPro
Home » Archive » Message


[Email To Friend][View in Live Context][prev topic « prev post | next post » next topic]
  Definition -- Big O
 
Subject: Definition -- Big O
Author: Alex_Raj
In response to: Big O Notation
Posted on: 12/14/2013 09:29:59 PM

Function f(x) is bounded above (upper-bounded) by function g(x) asymptotically, namely,

f(x) = O(g(x))

if and only if there exists a positive real number C and a real number x0 such that
|f(x)| <= C|g(x)| for all x>x0.


 

> On 12/14/2013 09:28:33 PM Alex_Raj wrote:

In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions.

Big O notation characterizes functions according to their growth rates: different functions with the same growth rate may be represented using the same O notation. The letter O is used because the growth rate of a function is also referred to as order of the function. A description of a function in terms of big O notation usually only provides an upper bound on the growth rate of the function.





References:

 


 
Powered by ForumEasy © 2002-2022, All Rights Reserved. | Privacy Policy | Terms of Use
 
Get your own forum today. It's easy and free.