用递归求最大公约数

#include <stdio.h>int GCD_C(int a,int b){if(a % b != 0){int z;z = a;a = b;b = (z % b);return GCD_C(a,b);}else {printf("辗转相除法求最大公约数:%d\n",b);return;}}int GCD_J(int x,int y){if(x - y < 0){y = y - x;return GCD_J(x,y);}if(x - y > 0){x = x - y;return GCD_J(x,y);}if(x - y == 0) {printf("辗转相减法求最大公约数:%d\n",y);                return;}}int main(){int a,b;printf("请输入2个正整数:");scanf("%d %d",&a,&b);GCD_C(a,b);GCD_J(a,b);return;}