euclidian_algo.c

#include <stdio.h>
#include <math.h>

int main (){
    int a, b, mod, gcd = 0;

    printf("Enter Number A (Larger):\n");
    scanf("%d", &a);
    printf("Enter Number B (Smaller):\n");
    scanf("%d", &b);
    int A = a, B = b;

    for(gcd; gcd == 0;){
        mod = a%b;
        if(mod == 0){
            gcd = b;
        }else{
            a = b;
            b = mod;
        }
    }
    printf("Greatest Common Divisor of %d & %d is %d\n", A, B, gcd);
    return 0;
}