大家都搜:
递归程序
1、compiled program───编成程序
2、exercise program───训练方案;锻炼计划
3、doctoral program───博士生项目
4、processing program───n.[计]处理程序;[计] 处理程序
5、headstart program───headstart程序
6、program error───[计]程序错误;程序误差
7、talks program───会谈计划
8、gifted program───天才计划
9、internship program───实习计划;实习项目
1、A base case is the bottom point of a recursive program where the operation is so trivial as to be able to return an answer directly.───基线条件是递归程序的最底层位置,在此位置时没有必要再进行Cao作,可以直接返回一个结果。
2、In this paper, a gerenal designing method for the patterns of recursive program transformation is presented, and some related examples are given.───本文提出递归程序变换模式的一般设计方法,并以具体示例说明之。
3、The paper introduces the general form of recursive model, the process of recursive program running and the recursive program design.───介绍了递归模型的一般形式、归程序的执行过程及递归程序设计。
4、The Investigation of a Special Method for Recursive Program Design───一类递归编程的特殊方法探讨
5、A non-recursive arithmetic of recursive program───递归程序的非递归化算法
6、A Discussion on the Recursive Program───递归程序探讨
7、It mainly investigates a special method for recursive program design and its applications a-bout the complicated recursion from the Angle of the mathematical formular.───重点从数学公式的角度探讨了复杂递归问题的一类特殊编程方法及其应用。
8、Every recursive program follows the same basic sequence of steps.───每一个递归程序都遵循相同的基本步骤。
1、An algorithm of automatic synthesis of recursive program using SGD technique and structural induction principle is designed and implemented on FELIX C-256 computer.
2、In this paper, a gerenal designing method for the patterns of recursive program transformation is presented, and some related examples are given.
3、It mainly investigates a special method for recursive program design and its applications a-bout the complicated recursion from the angle of the mathematical formular.
4、An interactive demonstrative system XDPTS according to the method of Recursive Program Transformation is described.
5、The paper introduces the general form of recursive model, the process of recursive program running and the recursive program design.
6、A base case is the bottom point of a recursive program where the operation is so trivial as to be able to return an answer directly.