Euclidean algorithm (for greatest common divisor)

1 //greatest common divisor for two numbers2#include <iostream>3 using namespacestd;4 intFintMintN)5 {6     if(n==0)7         returnm;8     Else9         returnF (n,m%n);Ten } One intMain () { A     intb; -     inttemp; -Cin>>a>>b; the     if(a<b) -     { -temp=A; -A=b; +b=temp; -     } +Cout<<f (b) <<Endl; A     return 0; at}

Euclidean algorithm, also known as the common factor method, is used to calculate the maximum of two nonnegative integers. The correctness of the results stems from the greatest common divisor C of a and b and the public approximations of a%b.

Euclidean algorithm (for greatest common divisor)