Sunday, 15 November 2015

C++ Program To Find GCD Using Functions

Problem :- Write A C++ Program To Find GCD (Greatest Common Divisor ) Using Functions

Logic :- I think before going to solve this problem you have to see C Program to Find GCD of two Numbers Using For Loop .

Solution :-

#include<iostream>
//#include<cstdlib>

using namespace std;

int gcd(int n,int m);

int main()
{
    int n,m,result;
    cout<<"\nEnter The Two Number To Find The GCD :\n";
    cin>>n>>m;
 
    result=gcd(n,m);
    cout<<"\nGCD of "<<n<<" and "<<m<<" is "<<result<<endl<<endl;

    return 0;
}
int gcd(int n,int m)
{
    if((n>=m)&&((n%m)==0))
        return(m);
    else
        gcd(m,(n%m));
}

Output:-

C++ Program To Find GCD Using Functions

Extreme Recommended:- Like our Facebook Page or Join our Facebook Group and Google plus Community for up-to-date. If you have any Query or Question you can ask in the group, I will Try To Solve your Query and try to answers of your Questions withing 24 Hours, You can also Email me or comment below Please suggest to your Friends to join and like our page and don't forget to Subscribe. Enter your Email and click to subscribe.

Ghanendra Yadav

Ghanendra Yadav

Hello, I Am Ghanendra Yadav Owner of This Blog, I am professional Blogger and Programmer. I Love Programming, Logo Making, And Banner Designing. My Highest Qualification is MCA From NIT Warangal. You Can Find Me On Social Media Through Below Link And If You Have Any Query Related To Programming And Other Subject Comment Below or You Can Mail Me I Will Try To Answer Within 24 Hours Email:- yghanendra@student.nitw.ac.in

Find me on Social Media

Facebook | Twitter | Google+ | RSS Feed

No comments:

Post a Comment