摘要
在《数据结构》中经常涉及到算法的设计问题,在很多算法的设计中,如采用递归函数来实现,则可使算法清晰易读,算法的正确性也容易得到证明。
In Data Structure,the problem of designing algorithms is often mentioned. When designing algorithms,if recursive function is adopted,the algorithms are possibly clearer and easier to read,and at the same time,the correctness of them can be easily proved.
出处
《镇江高专学报》
2004年第2期74-76,共3页
Journal of Zhenjiang College