Software Development

Big-Omega is the lower bound of a function is denoted as notation (Ω). Definition: Suppose we have two functions f(n) and g(n), then the function f(n) = Ω(g(n) if and only if there exists two positive constants c and k,…

Big-Oh notation pronounced as big o, is the upper bound of a function is denoted as capital O. Definition: Suppose we have two functions f(n) and g(n), then the function f(n) = O(g(n) if and only if there exists two pos…

Big-Theta is the tight bound or average bound of a function is denoted as notation (Θ). Definition: Suppose we have two functions f(n) and g(n), then the function f(n) = Θ(g(n) if and only if there exists three positiv…

General Properties: If a function f(n) is O(g(n)), then there exists a scalar constant a such that a * f(n) is also equals to O(g(n)) e.g., Suppose, f(n) = 2 * n + 5 which is O(n), then7 * f(n) = 14 * n + 35 = O(n) …