Sure, here is a simple C program that uses recursion to find the Greatest Common Divisor (GCD) of two numbers:

#include <stdio.h> int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { int num1, num2; printf("Enter two numbers: "); scanf("%d %d", &num1, &num2); printf("GCD of %d and %d is %d", num1, num2, gcd(num1, num2)); return 0; }

Here's how it works:

The gcd function takes two integers as arguments.

If the second number (b) is 0, it returns the first number (a) as the GCD.

If b is not 0, it calls itself with b and the remainder of a divided by b as the new arguments.

This process repeats until b is 0, at which point the function returns a as the GCD.

In the main function, the program asks the user to enter two numbers, then prints their GCD by calling the gcd function.

Question

Sure, here is a simple C program that uses recursion to find the Greatest Common Divisor (GCD) of two numbers:

```c
#include <stdio.h>

int gcd(int a, int b) {
    if (b == 0)
        return a;
    else
        return gcd(b, a % b);
}

int main() {
    int num1, num2;
    printf("Enter two numbers: ");
    scanf("%d %d", &num1, &num2);
    printf("GCD of %d and %d is %d", num1, num2, gcd(num1, num2));
    return 0;
}
```

Here's how it works:

1. The `gcd` function takes two integers as arguments.
2. If the second number (`b`) is 0, it returns the first number (`a`) as the GCD.
3. If `b` is not 0, it calls itself with `b` and the remainder of `a` divided by `b` as the new arguments.
4. This process repeats until `b` is 0, at which point the function returns `a` as the GCD.
5. In the `main` function, the program asks the user to enter two numbers, then prints their GCD by calling the `gcd` function.

Knowee AI · Accepted Answer

Sure, here is a simple C program that uses recursion to find the Greatest Common Divisor (GCD) of two numbers:

```c
#include <stdio.h>

int gcd(int a, int b) {
    if (b == 0)
        return a;
    else
        return gcd(b, a % b);
}

int main() {
    int num1, num2;
    printf("Enter two numbers: ");
    scanf("%d %d", &num1, &num2);
    printf("GCD of %d and %d is %d", num1, num2, gcd(num1, num2));
    return 0;
}
```

Here's how it works:

1. The `gcd` function takes two integers as arguments.
2. If the second number (`b`) is 0, it returns the first number (`a`) as the GCD.
3. If `b` is not 0, it calls itself with `b` and the remainder of `a` divided by `b` as the new arguments.
4. This process repeats until `b` is 0, at which point the function returns `a` as the GCD.
5. In the `main` function, the program asks the user to enter two numbers, then prints their GCD by calling the `gcd` function.

Write a program in C to find the GCD of two numbers using recursio

Question

Solution

Similar Questions

Upgrade your grade with Knowee