gcd_recursive_euclidean.cpp File Reference

Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm. More...

#include <iostream>

Include dependency graph for gcd_recursive_euclidean.cpp:

Go to the source code of this file.

Functions
int	gcd (int num1, int num2)
int	main ()

Detailed Description

Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm.

See also

gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp

Definition in file gcd_recursive_euclidean.cpp.

Function Documentation

gcd()

int gcd	(	int	num1,
		int	num2 )

algorithm

Definition at line 14 of file gcd_recursive_euclidean.cpp.

                            {
    if (num1 <= 0 | num2 <= 0) {
        throw std::domain_error("Euclidean algorithm domain is for ints > 0");
    }
 
    if (num1 == num2) {
        return num1;
    }
 
    // Everything divides 0
    if (num1 == 0)
        return num2;
    if (num2 == 0)
        return num1;
 
    // base case
    if (num1 == num2)
        return num1;
 
    // a is greater
    if (num1 > num2)
        return gcd(num1 - num2, num2);
    return gcd(num1, num2 - num1);
}

main()

int main

(

void

)

Main function

Definition at line 42 of file gcd_recursive_euclidean.cpp.

           {
    std::cout << "gcd of 120,7 is " << (gcd(120, 7)) << std::endl;
    try {
        std::cout << "gcd of -120,10 is " << gcd(-120, 10) << std::endl;
    } catch (const std::domain_error &e) {
        std::cout << "Error handling was successful" << std::endl;
    }
    std::cout << "gcd of 312,221 is " << (gcd(312, 221)) << std::endl;
    std::cout << "gcd of 289,204 is " << (gcd(289, 204)) << std::endl;
    return 0;
}