```python
def find_gcd(x, y):
    """
    Computes the greatest common divisor of two integers x and y using the Euclidean algorithm.
    The function is designed to be used iteratively to find the GCD of an array of numbers.
    For example, functools.reduce(find_gcd, [a, b, c]) would compute gcd(gcd(a, b), c).
    """
    while y:
        x, y = y, x % y
    return abs(x)

```