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
A list item stores pointers and an element to predecessor and successor. We call a pointer to a list item a handle . This looks simple enough, but pointers are so powerful tha

What is an unreachable code assertion An unreachable code assertion can be placed at the default case; if it's every executed, then program is in an erroneous state. A loop in

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory. A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j

An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer? O (1)

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

what is queues? how it work? and why it used? i want an assignment on queue .....

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Double Linked List In a doubly linked list, also known as 2 way lists, each node is separated into 3 parts. The first part is called last pointer field. It has the address of t

the deference between insertion,selection and bubble sort