Calculates the greatest common divisor using the iterative Euclidean algorithm. # Arguments `a` - First number `b` - Second number # Returns The GCD of a and b
(mut a: usize, mut b: usize)
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected