ALGORITHM
- In general Algorithm is any well defined sequential process that takes some values as input to produce desired output.
- Another definition related to Computer.Any Algorithm is any well defined computational process which takes set of input values and produces the set of output values.
- Thus concluding well definition i.e, Algorithm is a step by step sequential procedure of computational stacks that transform input values into the desired output.
- We now clear with the definition of Algorithm.Now we have to check our Algorithm which we made is working best , worst , normal?.These three cases are well-defined by the checking the complexity of the Algorithm.
- There are two types of complexity of Algorithm which used to describe the cases how your Algorithm is working as follows.
1. Time Complexity
2. Space Complexity
- Time Complexity: The Time Complexity of an Algorithm is the amount of time taken by an algorithm to run for compilation i.e execution of function of the size of the input to the problem.
- Space Complexity: The Space Complexity of an Algorithm is the amount of memory an Algorithm needs to run to Compilation varies with size of the problem it is solving.
- Better the time complexity of an Algorithm faster the Algorithm carry out to execute the particular work in practice.
- Apart from the complexity of the time. Space Complexity has its important role: This is essentially the number of memory blocks or cells needed by the Algorithm. A good Algorithm keeps these number of memory cells as less as possible.
- Expressing Algorithm: it can be expressed in many ways like Flowchart , natural languages, control tables(programming language processed by the interpreter ), and pseudocode s.
- Algorithm are made to make work easier and to get Very Efficient output.
