![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
递归算法
天上掉下来个程小白
专业程-小-白
展开
-
汉诺塔
#include<stdio.h> int i=1; int move(int n,char a,char c) { printf("第%d步:把第%d个盘子%c---->%c\n",i++,n,a,c); } int hanoi(int n,char a,char b,char c) { if(n==1) { move(n,a,c); } else { hanoi(n-1,a,c,b); move(n,a,c); hanoi(n-1,b,a,c); }.原创 2020-12-30 20:54:03 · 101 阅读 · 1 评论 -
2020-12-30
#include<stdio.h> int Fibonacci(int n){ if(n==1||n==2){ return 1; } else{ return Fibonacci(n-1)+Fibonacci(n-2); } } int main(){ int i,n; printf("请输入所需的斐波那契数列个数:"); scanf("%d",&n); for(i=1;i<=n;i++){ printf(" %d",Fibonacci(i)); .原创 2020-12-30 20:51:13 · 69 阅读 · 0 评论 -
n的阶乘
#include<stdio.h> int fact(int i) { if (i==0||i==1) return 1; else return(i*fact(i-1)); } int main() { int i; int y; printf("请输入一个数:\n"); scanf("%d",&i); y = fact(i); printf("%d!=%d",i,y); retur...原创 2020-12-30 20:42:42 · 275 阅读 · 0 评论