gcd using recursion-1

#include<stdio.h>
int gcd(int a,int b)
{
    int t;
    t=a%b;
    if(t==0)
        return b;
    else
        return gcd(b,t);
}
main()
{
    int l,h,k;
    if(l>h)
        k=l;
            l=h;
            h=k;
    scanf("%d%d",&h,&l);
    printf("%d",gcd(h,l));
}