terms generated For example if we generate fibobnacci series upto digits, the algorithm will generate the series as shown below: The Fibonacci series is : • An algorithm is a finite set of instructions to accomplish a particular task. • Algorithm consists of step-step-by instructions that are required to accomplish a task and helps the programmer to develop the program. • Program is an expression of algorithm in a programming language. • Algorithm analysis deals with the execution or running time of various operations involved.
• Space complexity of an algorithm is the amount of memory required to run to its completion. • Big Oh is often used to describe the worst-case of an algorithm. • Big Omega is used to describe the lower bound which is best way to solve the space complexity. • The Time complexity of an algorithm is given by the number of steps taken by the algorithm to complete the process.
• The efficiency of an algorithm is defined as the number of computational resources used by the algorithm. Points to remember: 12th Computer Chapter - - Algorithmic Strategies