Sequential iteration: the Fibonacci sequence code is called iteratively multiple times to match the number of workers that were executed in the SPE and Pthread tests above.
序列迭代：多次调用Fibonacci序列代码，从而与上面的SPE和Pthread测试中执行的工作者线程匹配。
The Fibonacci numbers are an integer sequence where for a given number, the Fibonacci value can be calculated using: F(n) = F(n-1) + F(n-2).
Fibonacci 数列是一种整数序列，可以使用以下算式计算各个 Fibonacci值：F(n) = F(n-1) + F(n-2)。
Fibonacci added the last two Numbers in the series together, and the sum became the next number in the sequence.
斐波那契将序列中的最后两位数字相加，用相加之作为序列的下一个数字。
If you run this code with a larger number for the Fibonacci sequence index (say, 12), you'll end up watching output scroll by for a long time.
如果对大的斐波纳契数列(比如说12)使用这段代码，将会看到长时间的滚动输出。
If you run this code with a larger number for the Fibonacci sequence index (say, 12), you'll end up watching output scroll by for a long time.
如果对大的斐波纳契数列(比如说12)使用这段代码，将会看到长时间的滚动输出。
应用推荐