```python
def find_gcd(x, y):
    """
    Finds the greatest common divisor (GCD) of two integers, x and y,
    using the Euclidean algorithm.
    """
    while y != 0:
        remainder = x % y
        x = y
        y = remainder
    
    # The GCD is conventionally a positive number.
    return abs(x)

```