Scribd
Upload
93 views8 pages

Asymptotic Notation

Asymptotic notation is used to describe how long an algorithm takes to run based on the size of the input. It focuses on the most significant term as the input size increases. The three notations are big O, which represents worst case running time, big Omega, which represents best case running time, and big Theta, which represents average case running time where the time is the same for all cases. Asymptotic analysis ignores less significant terms as the input size grows.

Uploaded by

Muhammad hanzla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
93 views8 pages

Asymptotic Notation

Asymptotic notation is used to describe how long an algorithm takes to run based on the size of the input. It focuses on the most significant term as the input size increases. The three notations are big O, which represents worst case running time, big Omega, which represents best case running time, and big Theta, which represents average case running time where the time is the same for all cases. Asymptotic analysis ignores less significant terms as the input size grows.

Uploaded by

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

Asymptotic Notation

Order of Growth
• Performing step count calculation for large algorithms is a time
consuming task. A natural way is to upper bound the time complexity
instead of finding the exact step count.
• Order of Growth or Rate of Growth of an algorithm gives a simple
characterization of the algorithm’s efficiency by identifying relatively
significant term in the step count.
• (e.g.) For an algorithm with a step count + 3n+ 1, the order of growth
depends on for large n. Other terms are relatively insignificant as n increases.
• Asymptotic analysis is a technique that focuses analysis on the
’significant term’.
Asymptotic Notation
• Asymptotic Notation is used to describe the running time of an
algorithm - how much time an algorithm takes with a given input, n.
• There are three different notations: big O, big Theta (Θ), and big
Omega (Ω).
• big-Θ is used when the running time is the same for all cases.
• big-O for the worst case running time.
• big-Ω for the best case running time.
Asymptotic Notation
Big-oh Notation
Big-oh Notation
Big-omega Notation
Big-theta Notation

You might also like