Write a function to compute the greatest common divisor given by Euclid’s algorithm, exemplified for j = 1980, K = 1617 as follows:- 33

PG76.c

#include <stdio.h>

void gcd(int, int);

int main()
{
    int num1, num2;
    printf("Enter two numbers: ");
    scanf("%d %d", &num1, &num2);
    gcd((num1 >= num2) ? num1, num2 : num2, num1);
    return 0;
}

void gcd(int big, int small)
{
    (small != 0) ? gcd(small, big % small) : printf("GCD is: %d.", big);
}