gcdprg.cpp

#include <iostream>
using namespace std;

class GCD {
    int *a, *b;

public:
    GCD() {
        a = new int;
        b = new int;
    }

    void input() {
        cout << "Enter two numbers: ";
        cin >> *a >> *b;
    }

    int findGCD_naive() {
        int gcd = 1;
        int limit = (*a < *b) ? *a : *b;
        for (int i = 1; i <= limit; i++) {
            if ((*a % i == 0) && (*b % i == 0)) {
                gcd = i;
            }
        }
        return gcd;
    }

    int findGCD_euclidean(int x, int y) {
        while (y != 0) {
            int temp = y;
            y = x % y;
            x = temp;
        }
        return x;
    }

    void displayGCDs() {
        int naiveGCD = findGCD_naive();
        int optimalGCD = findGCD_euclidean(*a, *b);

        cout << "Naive GCD: " << naiveGCD << endl;
        cout << "Optimal GCD (Euclidean Algorithm): " << optimalGCD << endl;
    }

    ~GCD() {
        delete a;
        delete b;
    }
};

int main() {
    GCD obj;
    obj.input();
    obj.displayGCDs();
    return 0;
}