PandA-2024.02
euclid.f
Go to the documentation of this file.
1 * euclid.f (FORTRAN 77)
2 * Find greatest common divisor using the Euclidean algorithm
3 
4  FUNCTION ngcd(NA, NB)
5  ia = na
6  ib = nb
7  1 IF (ib.NE.0) THEN
8  itemp = ia
9  ia = ib
10  ib = mod(itemp, ib)
11  GOTO 1
12  END IF
13  ngcd = ia
14  RETURN
15  END
function ngcd(NA, NB)
Definition: euclid.copy.f:5
int nb
Definition: aes.h:65

Generated on Mon Feb 12 2024 13:02:49 for PandA-2024.02 by doxygen 1.8.13