【摘要】 <正> 用递归算法描述某些问题(特别是非数值问题)的解法十分简洁,但其计算机实现常需耗费较多的存贮空间和计算时间。为提高速归算法的时空效率,常对递归算法施行某种等价变换,即对满足一定条件(称为可用性条件)的输入模式给出一个等价的输出模式。更多还原

【Abstract】 In this paper we present some equivalent tramformations from nontail-recursive algorithem to tail-recursive one,the latter corresponds directly to a iterative loop structure which in high efficiency in time-space1.A modification of Cooper’s transformation2.T1 modification: Using it we can handle the recursive algorithms baving two recursive brandies and! two recursion-call functions.3.T2 modification: Using it we can handle the recursive algorithms which allow recursion-call to appear in Boolean expression determinating branch condition.The proof of correctness for above equivalent transformations are given in Appendix更多还原