Algorithms and FunctionsAlgorithm: An algorithm is a stepbystep method for solving some problem. Characteristics of Algorithms:Algorithms generally have the following characteristics:
Analysis (Complexity) of AlgorithmsThe Analysis of an algorithm refers to the process of deriving estimates for the time and space needed to execute the algorithm. It is important to estimate the time (e.g., the number of steps) and space (e.g., the number of variables) required by algorithms. Knowing the time and space required by algorithm allows us to compare the algorithms that solve the same problem. For example, if one algorithm takes n steps to solve a problem and another algorithm takes n^2 steps to solve the same problem, we would prefer the first algorithm. This estimation of time and space needed to execute the algorithm is called the time and space complexity of the algorithm. The time required to execute an algorithm is a function of the input. Instead of dealing directly with the input, parameters are used to characterize the size of the input. e.g. if the input is a set containing n elements, the size of the input n. There are three cases worth noting about the time complexity of an algorithm since determining the exact time complexity of an algorithm in a difficult task.
Asymptotic NotationsAsymptotic Notations are used to describe the execution time of an algorithm. The notations show the order of growth of functions. Here the time taken by an algorithm is mapped regarding mathematical functions. There are many asymptotic notations like 0, θ, Ω,w each having its importance. 1. Bigoh notation: The function f (n) =O (g (n)) [read as "f of n is bigoh of g of n"] if and only if exist positive constant c and n_{0} such that f (n) ⩽ C x g (n) for all n, n ≥ n_{0} Example1: The function 4n + 3 = O (n) as 4n + 3 ⩽ 5n for all n ≥. Example2: The function 20n^{2} + 5n + 2 = O (n^{2}) as 20n^{2}+ 5n +2⩽21n^{2} for all n ≥. 2. Omega (Ω) Notation: The function f (n) = Ω (g (n)) [read as "f of n is omega of g of n"] if and only if there exists positive constant c and n_{0} such that f (n) ≥ C* g (n) for all n, n ≥ n_{0} Example1: The function 4n + 3 = Ω (n) as 4n + 3 ≥ 4n for all n ≥1. Example2: The function 20n^{2}+ 5n +2 = Ω (n) as 20n^{2}+ 5n +2 ≥ 20n^{2} for all n ≥1. 3. Theta (θ): The function f (n) = θ (g (n)) [read as "f is the theta of g of n"] if and only if there exists positive constant k_{1}, k_{2} and k_{0} such that k_{1}* g (n) ≤ f (n)≤k_{2}* g(n)for all n, n≥n_{0} Example1: The function 4n + 3 = θ (n) as 4n + 3 ≥ 4n for all n ≥ 3 and 4n + 3 ≤ 5n for all n ≥ 3. Example2: The function 20n^{2}+ 5n +2 = θ (n^{2}) as 20n^{2}+ 5n +2 ≤ 21n^{2} for all n ≥1 and 20n^{2}+ 5n +2 ≥ 20n^{2} for all n ≥ 1.
Next TopicProposition and Compound Statements

Ansible
Mockito
Talend
Azure
SharePoint
Powershell
Kali Linux
OpenCV
Kafka
Pandas
Joomla
Reinforcement