可怕的递归

2004-01-05 10:26:11 84 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

智能车竞赛飞檐走壁组立体赛道电磁引导线设计与实现本文深入解析了智能车竞赛飞檐走壁组立体赛道电磁引导线的核心设计与实现。针对垂直面、圆筒、跷跷板等立体元素，详细阐述了电磁线规格参数选择、三维空间铺设技巧及磁场调试方法，旨在帮助参赛队伍打造稳定可靠的导航系统，提升车模在复杂立体赛道上的通过率与稳定性。阅读详情

#include <stdlib.h>
#include <stdio.h>

static unsigned long count;

long fact(int x) {
++count;
/* fact(0) is 1, negative numbers don't make sense so we pretend
* they're 1. */
if (x < 2) return 1;
return x * fact(x - 1);
}

int main(void)
{
int i;
long f;

for (i = 1; i < 20; ++i) {
count = 0;
f = fact(i);
printf("fact(%02d) gives %ld after %lu iteration%s.\n",
i, f, count, count == 1 ? "" : "s");
}

return 0;
}

输出结果:
fact(01) gives 1 after 1 iteration.
fact(02) gives 2 after 2 iterations.
fact(03) gives 6 after 3 iterations.
fact(04) gives 24 after 4 iterations.
fact(05) gives 120 after 5 iterations.
fact(06) gives 720 after 6 iterations.
fact(07) gives 5040 after 7 iterations.
fact(08) gives 40320 after 8 iterations.
fact(09) gives 362880 after 9 iterations.
fact(10) gives 3628800 after 10 iterations.
fact(11) gives 39916800 after 11 iterations.
fact(12) gives 479001600 after 12 iterations.
fact(13) gives 1932053504 after 13 iterations.
fact(14) gives 1278945280 after 14 iterations.
fact(15) gives 2004310016 after 15 iterations.
fact(16) gives 2004189184 after 16 iterations.
fact(17) gives -288522240 after 17 iterations.
fact(18) gives -898433024 after 18 iterations.
fact(19) gives 109641728 after 19 iterations.

...全文

从‘最速控制’到代码：深入拆解韩京清ADRC中TD跟踪器的fhan函数（含Matlab/Simulink实例）本文深入解析韩京清ADRC中的fhan函数，从理论到代码实现，详细拆解其在Matlab/Simulink中的应用。通过分析最速控制问题和非线性TD的连续形式，揭示fhan函数在信号处理和噪声抑制中的独特优势，并提供工程实践中的参数整定和优化技巧。阅读详情

justhim

C语言 70,039 成员 243,237 内容

+ 关注 + 加入社区

切换为时间正序

justhim 2004-01-05

打赏
举报

再用迭代看看，原来就这么简单。

#include <stdlib.h>
#include <stdio.h>

static unsigned long count;

long fact(int x) {
long accumulator = 1;
++count;
while (x > 1) {
accumulator *= x--;
}
return accumulator;
}

int main(void) {
int i;
long f;

for (i = 1; i < 20; ++i) {
count = 0;
f = fact(i);
printf("fact(%02d) gives %ld after %lu iteration%s.\n",
i, f, count, count == 1 ? "" : "s");
}

return 0;
}

输出结果:
fact(01) gives 1 after 1 iteration.
fact(02) gives 2 after 1 iteration.
fact(03) gives 6 after 1 iteration.
fact(04) gives 24 after 1 iteration.
fact(05) gives 120 after 1 iteration.
fact(06) gives 720 after 1 iteration.
fact(07) gives 5040 after 1 iteration.
fact(08) gives 40320 after 1 iteration.
fact(09) gives 362880 after 1 iteration.
fact(10) gives 3628800 after 1 iteration.
fact(11) gives 39916800 after 1 iteration.
fact(12) gives 479001600 after 1 iteration.
fact(13) gives 1932053504 after 1 iteration.
fact(14) gives 1278945280 after 1 iteration.
fact(15) gives 2004310016 after 1 iteration.
fact(16) gives 2004189184 after 1 iteration.
fact(17) gives -288522240 after 1 iteration.
fact(18) gives -898433024 after 1 iteration.
fact(19) gives 109641728 after 1 iteration.

justhim 2004-01-05

打赏
举报

用goto看看这个递归在做什么。

#include <stdlib.h>
#include <stdio.h>

static unsigned long count;

long fact(int x) {
long accumulator = 1;
start:
++count;
/* fact(0) is 1, negative numbers don't make sense so we pretend they're 1. */
if (x < 2)
return accumulator;

/* we multiply the accumulator by our top-level x */
accumulator *= x;
/* and trim x by one */
x = x - 1;
goto start;
}

int main(void) {
int i;
long f;

for (i = 1; i < 20; ++i) {
count = 0;
f = fact(i);
printf("fact(%02d) gives %ld after %lu iteration%s.\n",
i, f, count, count == 1 ? "" : "s");
}

return 0;
}

输出结果:
fact(01) gives 1 after 1 iteration.
fact(02) gives 2 after 2 iterations.
fact(03) gives 6 after 3 iterations.
fact(04) gives 24 after 4 iterations.
fact(05) gives 120 after 5 iterations.
fact(06) gives 720 after 6 iterations.
fact(07) gives 5040 after 7 iterations.
fact(08) gives 40320 after 8 iterations.
fact(09) gives 362880 after 9 iterations.
fact(10) gives 3628800 after 10 iterations.
fact(11) gives 39916800 after 11 iterations.
fact(12) gives 479001600 after 12 iterations.
fact(13) gives 1932053504 after 13 iterations.
fact(14) gives 1278945280 after 14 iterations.
fact(15) gives 2004310016 after 15 iterations.
fact(16) gives 2004189184 after 16 iterations.
fact(17) gives -288522240 after 17 iterations.
fact(18) gives -898433024 after 18 iterations.
fact(19) gives 109641728 after 19 iterations.

可怕的递归

相关推荐