Now, invoke the next factorial.
现在，调用下一个factorial。
Like particles, you have to divide by N factorial..
像粒子这样，你需要除以n的阶乘。
The recursive C code is return num * factorial(num - 1).
递归的C代码是returnnum *factorial(num-1)。
Design: a clinical observation of factorial design.
设计：以患者为观察对象的析因设计。
You then branch to the function using brsl $lr, factorial.
然后需要使用brsl $lr, factorial对函数进行分支。
That is, now we have to divide by NA factorial times NB factorial.
就是说，现在我们要除以NA的阶乘乘以nb的阶乘的积。
Otherwise, a recursive function is used to calculate the factorial.
否则，使用递归函数计算阶乘。
After computing the factorial, you now want to print it out using printf.
计算了阶乘之后，现在需要用printf将其打印出来。
Write a function that calculates a number's factorial using recursion.
写出一个用递归来计算阶乘的函数。
Results will later be displayed in the labels beneath the factorial buttons.
结果稍后将显示在阶乘按钮下方的标签中。
The same method to calculate the factorial, this time written for the Duby compiler.
下面同样是计算阶乘的方法，这次是针对Duby编译器而写的。
What you want to do with this value in register 3 is to calculate the factorial of it.
在寄存器3中想要做的是计算此值的阶乘。
Then, because num is greater than 0, factorial will be called again, this time with 3.
然后，由于 num大于0，因此会再次调用factorial，不过这次是计算 3 的阶乘了。
If you've written factorial code, you've probably noticed that the code is still wrong.
编写了阶乘代码后，您可能发现该代码仍有错误。
In this program you will have two stack frame sizes — one for main and one for factorial.
在本程序中，需要两个堆栈框架大小——一个用于main，一个用于factorial。
Therefore, you need to pass it as the first (and only) parameter to the factorial function.
因而，需要将其作为第一个（也是惟一一个）参数传递给factorial函数。
According to the decomposition method, a majority of the factorial using arrays to achieve.
按分解的方法，将一个大数的阶乘用数组实现。
So let's just break that out then, and use the Stirling's approximation for each of the factorial terms.
那让我们在这指出，使用斯特林近似，对每一阶乘项。
What happens, for instance, if you try to find the value of the factorial of 4? Let's follow the sequence
例如，如果我们要计算4的阶乘为多少，到底会发生什么呢？
Recall our factorial method in the section called "Nesting method Definitions", previously in this chapter.
回忆我们在上一章中“嵌套方法的定义”章节看到的factorial方法。
For fractional factorial designs several different approaches to estimate this variance have been suggested.
对因子设计而言，现已有若干种不同方法来估计实验误差方差。
The factorial of a number is computed as that number times all of the Numbers below it up to and including 1.
计算某个数的阶乘就是用那个数去乘包括1在内的所有比它小的数。
We did the factorial function earlier and it's the product of a number and the factorial of that number minus one.
早些时候我们编写过一个计算fibtorial数的函数它便是某数与它减一的factorial数的积.
There is nothing to stop it when it hits zero, so it would continue calling factorial on zero and the negative numbers.
当计算到零时，没有条件来停止它，所以它会继续调用零和负数的阶乘。
For an exercise in class definition, you'll use the caching factorial calculator of factorial.py, shown in Listing 4.
我们用高速缓存阶乘计算器factorial . py作为类定义的练习，如清单4所示。
Did you notice that we use I as a parameter name twice, first in the factorial method and again in the nested fact method?
你注意到了吗，我们两次把i作为一个参数名字，第一次是在factorial方法里，然后是在嵌套的fact方法里。
After the definition of the nested method, factorial calls it with the passed-in value I and the initial accumulator value of 1.
在嵌套方法的定义后面，factorial以传入值i和初始accumulator值1来调用它。
You can test your factorial class using the following code, which you'll also find in the file factorial.py (see Resources).
可以用下面的代码测试这个Factorial类，可以在文件factorial . py中找到这些代码(请参阅参考资料)。
Main's stack will be the minimum of 32 bytes, while factorial's will be 48, because factorial has a local variable to store.
main的堆栈最小，为32字节，而factorial的堆栈则为48字节，原因是factorial需要存储本地变量。
Main's stack will be the minimum of 32 bytes, while factorial's will be 48, because factorial has a local variable to store.
main的堆栈最小，为32字节，而factorial的堆栈则为48字节，原因是factorial需要存储本地变量。
应用推荐