Data Structures - Asymptotic Analysis

 

Data Structures - Asymptotic Analysis


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

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.

Ο(f(n)) = { g(n) : there exists c > 0 and n0 such that f(n) ≤ c.g(n) for all n > n0. }

Comments

Popular posts from this blog

Hibernate Many to Many Relationship

Why Integral Calculus limit tending to infinity a sacrilege

Introduction