HCF recursive.cpp

#include <iostream>

using namespace std;

int euclid (int, int);

int main() {

    int a, b;

    cout<<"Enter First Number"<<endl;

    cin>>a;
hdjsjw
    mdmdksks
hahaha free tee
    cout<<"Enter Second Number"<<endl;

    cin>>b;

    cout<<"\n- - - - - - - -\n";

    cout<<"The HCF of "<<a<<" and "<<b<<" is "<<euclid(a, b);

    return 0;

}

int euclid(int a, int b){

    if(a<b){

        int temp = b;

        b = a;

        a = temp;

    }

    

    if(a%b == 0){

        return b;

    }

    return euclid(b, (a%b));

}