iframe-proxy | Sunbelt Computer Software

60 lines (53 loc) · 1.34 KB

 *  Given two numbers, determine the greatest common divisior of the two numbers.
#include <iostream>
int gcd1( int a, int b ) {
    while( b > 0 ) {
        int temp = a % b;
        a = b;
        b = temp;
    return a;
int gcd2( int a, int b ) {
    if ( b == 0 ) return a;
    if ( a == 0 ) return b;
    return gcd2(b, a % b);
int gcd3( int a, int b ) {
    if ( a == 0 ) return b;
    if ( b == 0 ) return a;
    while ( a != b ) {
        if ( a > b ) {
            a = a-b;
        } else {
            b = b-a;
    return a;
int gcd4 ( int a, int b ) {
    if ( a == 0 ) return b;
    if ( b == 0 ) return a;
    if ( a == b ) return a;
    if ( a > b ) return gcd4(b, a-b);
    else  return gcd4(a, b-a);
    int a, b;
    std::cout << "Enter number 1 : ";
    std::cin >> a;
    std::cout << "Enter number 2 : ";
    std::cin >> b;
    std::cout << "GCD of " << a << " and "
              << b << " is " << gcd1(a,b) << std::endl;
    std::cout << "GCD of " << a << " and "
              << b << " is " << gcd2(a,b) << std::endl;
    std::cout << "GCD of " << a << " and "
              << b << " is " << gcd3(a,b) << std::endl;
    std::cout << "GCD of " << a << " and "
              << b << " is " << gcd4(a,b) << std::endl;
    return 0;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

gcd.cpp

Latest commit

History

gcd.cpp

File metadata and controls