Define big theta notation, Data Structure & Algorithms

Define Big Theta notation

Big Theta notation (θ): The upper and lower bound for the function 'f' is given by the big oh notation (θ). Considering 'g' to be a function from the non-negative integers to the positive real numbers, we describe θ(g) as the set of function f  such that  for some real constant c1 and c2 >0 and some non negative integers constant n0 , c1g(n)≤f f(n)≤c2g(n) for all n≥n0.  Mathematically, θ(g(n))={f(n): there exists positive constants c1 and c2 like that c1g(n)≤f f(n)≤c2g(n) for all n, n≥n0} , we say "f is oh of g"

 

Posted Date: 5/10/2013 3:12:47 AM | Location : United States







Related Discussions:- Define big theta notation, Assignment Help, Ask Question on Define big theta notation, Get Answer, Expert's Help, Define big theta notation Discussions

Write discussion on Define big theta notation
Your posts are moderated
Related Questions
write pseudocode to implement a queue with two stacks

Efficiency of Linear Search How much number of comparisons is there in this search in searching for a particular element? The number of comparisons based upon where the reco

basic calculation for algorith.

/* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

implement multiple stack in one dimensional array

Ask question #sdgsdgsdginimum 100 words accepted#

Explain the Arrays in Ruby Ruby arrays are dynamic arrays which expand automatically whenever a value is stored in a location beyond current end of the array. To the programmer

how to convert 12 hour format into 24 hour format using c program

Write an algorithm for binary search. What are its limitations? .

Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but