英汉例句

• in this program, all state changes are brought about by re-running the recursive function with completely self-consistent data.

  在这个程序中，所有状态改变都是通过使用完全前后一致的数据重新运行递归程序而实现的。

• this paper discuss the technique in writing recursive programs based on the principle of recursive function and stack for problems such as maze, hanoi.

  文中以迷宫、汉诺塔等为例，根据计算机堆栈原理，具体讨论了用递归函数 解题的方法和技巧。

• in addition, we explain the design of lyapunov recursive function and the basic theory of the feedback equivalence passive systems in detail.

  李雅普诺夫递推设计方法是本文的主要研究方法，在本章中作了详细的论述。

• walk through these dependencies by writing a recursive function that can find the latest version of a plug-in (in case duplicate plug-ins are in the same system) and all its dependencies.

  我们可以编写一个递归函数来遍历这些依赖性，它可以查找某个插件的最新版本（针对在相同的系统中有重复插件的情况）以及它的所有依赖性。

• a conditional branch in a recursive function that does not make a recursive call.

  基準条件：递归函数中一个条件分支，要实现终止递归调用。

• this recursive function works fine, but it has one main shortcoming -- every iteration of the recursion will be passing the same value for the-string.

  这个递归函数能很好地工作，不过它有一个主要的缺点 ——递归的每一次迭代都要为the-string传递相同的值。

• main is a recursive function -- it accepts a node set in the current argument and loops over the node set.

  main是一个递归函数，它用current参数接受一个节点集并遍历该节点集。

• you need to do this because your parameter will get clobbered on the recursive function call, and you will need access to it afterwards.

  之所以需要这么做是因为参数会在递归函数调用上被截断，而以后却还需要访问它。

• you「ve implemented a recursive function in lisp.

  您已经在lisp 中实现了递归函数。

• we will be substituting a call to this find() method for our recursive function described previously when we get this new version, and so should you.

  获得新版本后，我们将调用这个find()方法，替代前面介绍的递归函数，您也应该如此。

• converting a common loop to a recursive function

  将一个常见的循环转化为递归函数

• based on the theory of recursive function , this method adopts primitive recursive formula in function representation and is easy to be implemented on computer.

  其发现能力也有所提高，该方法采用原始递归式定义函数，递归函数在理论上比较完善，故该方法具有很好的理论依据并且便于计算机实现。

• we put forward a recursive function of edge adaptability, and construct an edge recombination procedure, which is easy to implement. it is a new exploration to solution method of tsp.

  本文给出了边适应性函数的数学模型，并且构造了一种易于实现的路径重组算法。

• goto statements and recursive function calls may be supported by the language definition, but it is known that using other methods makes the code easier to understand.

  语言规范可能支持goto语句和递归函数调用，但使用其他方法能够让代码更易于理解。

• the program then seeds the recursive function with the first item on the list and the remaining list.

  然后程序以列表中的第一项及其余部分列表为种子开始递归函数。

• the steps required to write such a recursive function are listed below, and listing 3 presents the source code of the function itself.

  编写这种递归函数需要执行的步骤如下所示，清单3给出了这个函数的源代码。

• given that everyone else uses factorial, we」ll use a simpler recursive function that sums up a sequence.

  有人用阶乘描述它，而我们将使用更简单的递归函数--对一个列表求和。

• examples are given for solving complex problem by transferring variables in recursive function program, and the recursive function programs show excellent capability for solving non-numeral problem.

  给出了递归函数调用时利用变量传递解决复杂问题的实例，展示了递归算法在解决非数值运算问题中的独特解题方式和效果。