摘要
递归程序可以嵌套调用,因此在运行过程中其运行轨迹较复杂。本文将用数据结构中的树型结构来形象化描术递归程序运行轨迹,使递归程序的运行轨迹更加清晰明了和易于理解。
The traces in recursive programs usually are complicated when running the program. In this article, we described the traces in recursive programs by tree structure from Data Structure in order to make it easier for readers to understand the recursive programs.
出处
《现代计算机》
1999年第3期38-39,共2页
Modern Computer