C program to find GCD using recursion

Program:

#include<stdio.h>

int gcd(int num1, int num2)
{
    int rem;
    if(num1 % num2 != 0)
    {
        rem = num1 % num2;
        num1 = num2;
        num2 = rem;
    }
    else
        return gcd(num1, num2);
}

int main()
{
    int num1, num2, gcd_value;
    printf("Enter two numbers: \n");
    scanf("%d %d", &num1, &num2);
    gcd_value = gcd(num1, num2);
    printf("GCD of %d and %d is: %d \n", num1, num2, gcd_value);
}


Output: