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 the algorithm for Binary search. Also apply this algorithm on the following data. 22, 44, 11, 88, 33, 55, 77, 66

An AVL tree is a binary search tree that has the given properties: The sub-tree of each of the node differs in height through at most one. Each sub tree will be an AVL tre

i need the full concept of it... please can anyone provide

Give the example of bubble sort algorithm For example List: - 7 4 5 3 1. 7 and 4 are compared 2. Since 4 3. The content of 7 is now stored in the variable which was h

The controversy of RISC versus CISC never ends. Suppose that you represent an advocate for the RISC approach; write at least a one-page critic of the CISC approach showing its disa

State in detail about the Integer Carrier set of the Integer ADT is the set {..., -2, -1, 0, 1, 2, ...}, and  operations on these values are addition, multiplication, subtrac

Using stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not Algorithm parseparens This algorithm reads a source program and

how to reduce the number of passes in selection sort

Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.