Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
147 views3 pages

Big Theta

Big Theta notation (Θ) bounds a function from above and below to define its exact asymptotic behavior. For a function f(n), Θ(g(n)) represents the set of functions where there exist positive constants c1, c2, and n0 such that 0 <= c1*g(n) <= f(n) <= c2*g(n) for all n >= n0. This means that for large n, f(n) is always between c1*g(n) and c2*g(n). For example, 3n^3 + 6n^2 + 6000 = Θ(n^3), since lower order terms can be ignored for large

Uploaded by

Apoorva Panchal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
147 views3 pages

Big Theta

Big Theta notation (Θ) bounds a function from above and below to define its exact asymptotic behavior. For a function f(n), Θ(g(n)) represents the set of functions where there exist positive constants c1, c2, and n0 such that 0 <= c1*g(n) <= f(n) <= c2*g(n) for all n >= n0. This means that for large n, f(n) is always between c1*g(n) and c2*g(n). For example, 3n^3 + 6n^2 + 6000 = Θ(n^3), since lower order terms can be ignored for large

Uploaded by

Apoorva Panchal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Big Theta Notation

Big Theta(θ) Notation


Introduction
The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t
depend on machine specific constants, and doesn’t require algorithms to be implemented and time
taken by programs to be compared. Asymptotic notations are mathematical tools to represent time
complexity of algorithms for asymptotic analysis. The 3 asymptotic notations are mostly used to
represent time complexity of algorithms: Big Oh Notation, Big Theta(Θ) notation and Big Omega(Ω).

We will be looking into Theta notation in detail:

Θ Notation
 The theta notation bounds a function from above and below, so it defines exact asymptotic behavior.
A simple way to get Theta notation of an expression is to drop low order terms and ignore leading
constants.

For example, consider the following expression.


3n3 + 6n2 + 6000 = Θ(n3)
Dropping lower order terms is always fine because there will always be a n0 after which
Θ(n3) has higher values than Θ(n2) irrespective of the constants involved.
For a given function g(n), we denote Θ(g(n)) is following set of functions.

Θ(g(n)) = {f(n): there exist positive constants c1, c2 and n0 such

that 0 <= c1*g(n) <= f(n) <= c2*g(n) for all n >= n0}

The above definition means, if f(n) is theta of g(n), then the value f(n) is always between c1*g(n) and
c2*g(n) for large values of n (n >= n0). The definition of theta also requires that f(n) must be non-
negative for values of n greater than n0.

The growth rate for functions are:

1<lg n<√ x<n<nlgn<n2<n3…<2n<3n...<n!<nn


Questions:

You might also like