Scribd
Upload
52 views3 pages

Team Members:: Apoorva Panchal - 17BCP006: Mentor Dhruvi Bhatt - 17BCP009 Foram Parikh - 17BCP020

The document discusses Big Theta (Θ) notation, which provides an asymptotic upper and lower bound for analyzing algorithms. It defines Θ notation as bounding a function from above and below to describe its exact asymptotic behavior. An example shows that the expression 3n3 + 6n2 + 6000 = Θ(n3) because lower order terms can be ignored for large n. Θ(g(n)) is defined as the set of functions f(n) that are between c1*g(n) and c2*g(n) for some constants c1, c2 and all n greater than or equal to n0. Common asymptotic growth rates are listed.

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 PDF, TXT or read online on Scribd
52 views3 pages

Team Members:: Apoorva Panchal - 17BCP006: Mentor Dhruvi Bhatt - 17BCP009 Foram Parikh - 17BCP020

The document discusses Big Theta (Θ) notation, which provides an asymptotic upper and lower bound for analyzing algorithms. It defines Θ notation as bounding a function from above and below to describe its exact asymptotic behavior. An example shows that the expression 3n3 + 6n2 + 6000 = Θ(n3) because lower order terms can be ignored for large n. Θ(g(n)) is defined as the set of functions f(n) that are between c1*g(n) and c2*g(n) for some constants c1, c2 and all n greater than or equal to n0. Common asymptotic growth rates are listed.

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 PDF, TXT or read online on Scribd
You are on page 1/ 3

Team Members:

Apoorva Panchal – 17BCP006 : Mentor

Dhruvi Bhatt – 17BCP009

Foram Parikh – 17BCP020


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<√𝑥<n<nlgn<n2<n3…<2n<3n...<n!<nn
Questions:

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy