classification by implementation when translating series of steps or processes into working algorithmthere are number of forms that it may take the heart of the algorithm may employ some assetsdescribed further in this section recursion recursive algorithms are the ones that make calls to themselves until certain condition is satisfied some problems are more easily expressed by implementing their solution through recursion one classic example is the towers of hanoi there are also different types of recursive algorithmssome of which include single and multiple recursionindirect recursionanonymous recursionand generative recursion an iterative algorithmon the other handuses series of steps or repetitive construct to formulate solution this repetitive construct could be simple while loop or any other kind of loop iterative solutions also come to mind more easily than their recursive implementations logical one implementation of an algorithm is expressing it as controlled logical deduction this logic component is comprised of the axioms that will be used in the computation the control component determines the manner in which deduction is applied to the axioms this is expressed in the form algorithm logic control this forms the basis of the logic programming paradigm the logic component determines the meaning of the algorithm the control component only affects its efficiency without modifying the logicthe efficiency can be improved by improving the control component serial or parallel the ram model of most computers allows for the assumption that computing is done one instruction at time serial algorithmsalso known as sequential algorithmsare algorithms that are executed sequentially execution commences from start to finish without any other execution procedure