GCD and LCM using Function

Write Program to calculate  GCD and LCM of two numbers using Function


#include<stdio.h>
void gcd(int,int);
void lcm(int,int);

int main()
{
    int a,b;

    printf("Enter two numbers: \t");
    scanf("%d %d",&a,&b);

    lcm(a,b);
    gcd(a,b);


    return 0;
}

//function to calculate l.c.m
void lcm(int a,int b)
{
    int m,n;

    m=a;
    n=b;

    while(m!=n)
    {
        if(m<n)
            m=m+a;
        else
            n=n+b;
    }

    printf("\n L.C.M of %d  &  %d is %d",a,b,m);
}

//function to calculate g.c.d
void gcd(int a,int b)
{
    int m,n;

    m=a;
    n=b;

    while(m!=n)
    {
        if(m>n)
            m=m-n;
        else
            n=n-m;
    }

    printf("\n G.C.D of %d  &  %d is %d",a,b,m);
}


========================================

Program for Fibonacci series using Recursion

#include <stdio.h>

int fibo(int);



int main()

{

    int num;

    int result;



    printf("Enter the nth number in fibonacci series: ");

    scanf("%d", &num);

    if (num < 0)

    {

        printf("Fibonacci of negative number is not possible.\n");

    }

    else

    {

        result = fibo(num);

        printf("The %d number in fibonacci series is %d\n", num, result);

    }

    return 0;

}

int fibo(int num)

{

    if (num == 0)

    {

        return 0;

    }

    else if (num == 1)

    {

        return 1;

    }

    else

    {

        return(fibo(num - 1) + fibo(num - 2));

    }

}