An elegant program for Euclid‘s algorithm

// Euclid's algorithm for greatest common divisor
int euclidAlgorithm (int A, int B){
    
     A=abs(A);
     B=abs(B);
     while (B!=0){
    
          while (A>B) A=A-B;
          B=B-A;
     }
     return A;
}