C语言递归算法（一）

1.辗转相除法求最大公约数

#include <stdio.h>
/*辗转相除法求最大公约数*/
int gcd(int m, int n);
int main(void){
	int m, n, t;
	scanf_s("%d %d", &m, &n);
	if (m < n){
		t = m;
		m = n;
		n = t;
	}
	n = gcd(m, n);
	printf("%d", n);
	while (true){}
	return 0;
}
int gcd(int m, int n){
	int r;
	r = m % n;
	if (r == 0){
		return n;
	}else{
		gcd(n, r);
	}
}

2.小数阶乘

#include <stdio.h>
int factrial(int a){   
    int product=1;
    if (a==1){
        return product;
    }else{
        product=a*factrial(a-1);
    }
}
int main(int argc, char const *argv[]){
    printf("%d\n",factrial(3));
    return 0;
}