Program to find GCD of floating point numbers in C++
https://www.tutorialspoint.com/program-to-find-gcd-of-floating-point-numbers-in-cplusplus
-
10-09-2020 - |
Question
In this tutorial, we will be discussing a program to find GCD of floating point numbers.
For this we will be provided with two integers. Our task is to find the GCD (Greatest common divisor) of those two provided integers.
Example
#include <bits/stdc++.h> using namespace std; //returning GCD of given numbers double gcd(double a, double b){ if (a < b) return gcd(b, a); if (fabs(b) < 0.001) return a; else return (gcd(b, a - floor(a / b) * b)); } int main(){ double a = 1.20, b = 22.5; cout << gcd(a, b); return 0; }
Output
0.3
Not affiliated with Tutorialspoint