Setting Rythm in Algorithm (Contd)
Types of Algorithm and its Classification Every Algorithm falls under a specific class. The Algorithms' speed is measured in terms of many basic operations it performs. From increasing order of growth they are classified as follows: a. Constant Time Algorithm b. Logarithmic Algorithm c. Linear Time Algorithm d. Polynomial Time Algorithm e. Exponential Time Algorithm Formally, the complexity of algorithms is derived using the asymptotic notation. These are formal notational methods for stating the growth of resource needs (storage and efficiency) of an algorithm. There are four basic notations used when describing resource needs. These are: O(f(n)), o(f(n)), \Omega(f(n))Ω(f(n)), and \Theta(f(n))Θ(f(n)) - Big-O, Little-o, Omega and Theta respectively. a. Big O: O(f(n)) establishes an upper bound on the function. This [...]



