Scribd
Upload
13 views2 pages

Asymptotic Notation, Algorithm Complexity

The document discusses asymptotic analysis, which defines the mathematical bounds of an algorithm's run-time performance, including best, average, and worst case scenarios. It explains the complexity of algorithms in terms of running time and storage space, and introduces common asymptotic notations such as O, Ω, and θ to express upper and lower bounds of running time. Additionally, it provides examples of algorithm complexities, including linear search and merge sort.

Uploaded by

prashant.naresh
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
13 views2 pages

Asymptotic Notation, Algorithm Complexity

The document discusses asymptotic analysis, which defines the mathematical bounds of an algorithm's run-time performance, including best, average, and worst case scenarios. It explains the complexity of algorithms in terms of running time and storage space, and introduces common asymptotic notations such as O, Ω, and θ to express upper and lower bounds of running time. Additionally, it provides examples of algorithm complexities, including linear search and merge sort.

Uploaded by

prashant.naresh
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/ 2

Data Structures - Asymptotic Analysis/Notations

Asymptotic analysis of an algorithm refers to defining the mathematical boundation / framing of its
run-time performance. Using asymptotic analysis, we can very well conclude the best case, average
case, and worst case scenario of an algorithm.

Asymptotic analysis is input bound i.e., if there's no input to the algorithm, it is concluded to work in
a constant time. Other than the "input" all other factors are considered constant.

Asymptotic analysis refers to computing the running time of any operation in mathematical units of
computation. For example, the running time of one operation is computed as f(n) and may be for
another operation it is computed as g(n2). This means the first operation running time will increase
linearly with the increase in n and the running time of the second operation will increase exponentially
when n increases. Similarly, the running time of both operations will be nearly the same if n is
significantly small.

Complexity of Algorithm
The complexity of an algorithm M is the function f(n) which gives the running time and/or storage
space requirement of the algorithm in terms of the size n of the input data. The storage space required
by an algorithm is simply a multiple of data size n. Accordingly, the term “complexity” shall refer tp
the running time of the algorithm.

Usually, the time required by an algorithm falls under three types –


 Best Case – Minimum time required for program execution.
 Average Case – Average time required for program execution.
 Worst Case – Maximum time required for program execution.

Asymptotic Notations
Following are the commonly used asymptotic notations to calculate the running time complexity of an
algorithm.
 Ο Notation
 Ω Notation
 θ Notation

Big Oh Notation, Ο
The notation Ο(n) is the formal way to
express the upper bound of an algorithm’s
running time. It measures the worst case time
complexity or the longest amount of time an
algorithm can possibly take to complete.
For example, for a function f(n)
Ο(f(n)) = { g(n) : there exists c > 0 and n0
such that f(n) ≤ c.g(n) for all n > n0. }

Page | 1
By: Dr. Ankur Garg
Omega Notation, Ω
The notation Ω(n) is the formal way to express
the lower bound of an algorithm’s running
time. It measures the best case time
complexity or the best amount of time an
algorithm can possibly take to complete.
For example, for a function f(n)
Ω(f(n)) ≥ {g(n): there exists c > 0 and n0 such
that g(n) ≤ c.f(n) for all n > n0.}

Theta Notation, θ
The notation θ(n) is the formal way to express
both the lower bound and the upper bound of an
algorithm’s running time. It is represented as
follows –
For example, for a function f(n)

θ(f(n)) = { g(n) if and only if g(n) = Ο(f(n)) and


g(n) = Ω(f(n)) for all n > n0. }

Common Asymptotic Notations


Following is a list of some common asymptotic notations –
constant − Ο(1)

logarithmic − Ο(log n)

linear − Ο(n)

n log n − Ο(n log n)

quadratic − Ο(n2)

cubic − Ο(n3)

polynomial − nΟ(1)

exponential − 2Ο(n)

Algorithm(s) Complexity

Linear Search − O(n)

Binary Search − O(log n)

Bubble Sort − O(n2)

Merge – sort − O(n log n)

Page | 2
By: Dr. Ankur Garg

You might also like