how to get hcf of two number in c++

Nikunj singhal answered on July 6, 2022 Popularity 6/10 Helpfulness 4/10

answer how to get hcf of two number in c++

how to get hcf of two number in c++

Comment

#include<iostream>
using namespace std;

// This method improves complexity of repeated substraction
// By efficient use of modulo operator in euclidean algorithm
int getHCF(int a, int b)
{
    return b == 0 ? a : getHCF(b, a % b); 
}

int main()
{
    int num1 = -36, num2 = 60;

    // if user enters negative number, we just changing it to positive
    // By definition HCF is highest positive number that divides both numbers
    // -36 & 60 : HCF = 12 (as highest num that divides both)
    // -36 & -60 : HCF = 16 (as highest num that divides both)
    num1 = (num1 > 0) ? num1 : -num1;
    num2 = (num2 > 0) ? num2 : -num2;
    
    cout<<"HCF of "<<num1<<" and "<<num2<<" is "<<getHCF(num1, num2);
    
    return 0;
}
// Time Complexity: log(max(a,b))

Popularity 6/10 Helpfulness 4/10 Language cpp

Source: prepinsta.com

Tags: c++ get

Link to this answer
Share Copy Link

Contributed on Jul 06 2022

Nikunj singhal

0 Answers Avg Quality 2/10

how to get hcf of two number in c++

Contents

More Related Answers

how to get hcf of two number in c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.