从递归算法到非递归的变换

Transformation from recursive algorithms to non-recursive algorithms

探讨了实现递归算法替换非递归算法的多种方法.对于那些不支持递归的程序设计语言（如Fortran语言）,通过采用这些方法,不仅为递归问题的非递归化找到了一些有效的解决途径.而且提高了程序的执行效率.

This paper makes a study of various ways for transforming recursive algorithms to non-recursive algorithms, which help to increase the eificiency for programming. A effective solution to the problem of recursiveness has been worked out for those programming languages (such as Fortran language), which don't support recursive algorithm.