d as follows... Every algorithm must satisfy the following specifications... 1. Input - Every algorithm must take zero or more number of input values from external. 2. Output - Every algorithm must produce an output as result. 3. Definiteness - Every statement/instruction in an algorithm must be clear and unambiguous (only one interpretation) 4. Finiteness - For all different cases, the algorithm must produce result within a finite number of steps. 5. Effectiveness - Every instruction must be basic enough to be carried out and it also must be feasible. *Time Complexity