A Swift function to compute the greatest common divisor (GCD) of two integers using the Euclidean algorithm.

gcd_euclidean.swift

/// Computes the greatest common divisor (GCD) of two integers using the Euclidean algorithm.
/// - Parameters:
///   - a: An integer value.
///   - b: Another integer value.
/// - Returns: The greatest common divisor of `a` and `b`.
func gcd(_ a: Int, _ b: Int) -> Int {
    b == 0 ? a : gcd(b, a % b)
}

// Example usage
let num1 = 48
let num2 = 18
let result = gcd(num1, num2)
print("The GCD of \(num1) and \(num2) is \(result).")