euclid.copy.f

Go to the documentation of this file.

*     euclid.f (FORTRAN 77)
*     Find greatest common divisor using the Euclidean algorithm

      FUNCTION ngcd(NA, NB)
        integer, value :: NA ! input
        integer, value :: NB ! input
        ia = na
        ib = nb
    1   IF (ib.NE.0) THEN
          itemp = ia
          ia = ib
          ib = mod(itemp, ib)
          GOTO 1
        END IF
        ngcd = ia
        RETURN
      END