**The Program in C ** **to calculate the Greatest common divisor of two numbers using a recursive function is given below**:

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

## Output:

Enter two numbers: 2

6

GCD of 2 and 6 is 2

## Pro-Tips**💡**

This program uses the Euclidean algorithm to find the GCD of two numbers using recursion.

The gcd() function takes two integers as input and returns their GCD.

The main() function prompts the user to enter two numbers, and then calls the gcd() function to find their GCD and prints the result.

**Learn C-Sharp ↗**

C-sharp covers every topic to learn about C-Sharp thoroughly.

**Learn C Programming ↗**

C-Programming covers every topic to learn about C-Sharp thoroughly.

**Learn C++ Programming↗**

**Learn C++ Programming↗**

C++ covers every topic to learn about C-Sharp thoroughly.