Consider the following ANSI C function:int SomeFunction(int x, int y) { if ((x == 1) || (y == 1)) return 1; if (x == y) return x; if (x > y) return SomeFunction(x - y, y); if (y > x) return SomeFunction(x, y - x); }The value returned by SomeFunction(15, 255) is ________.

The given C function implements the Euclidean algorithm for computing the greatest common divisor $\gcd(x, y)$ using repeated subtraction:

• If either operand is $1$, it returns $1$.

• If both operands are equal, it returns that value.

• Otherwise, it subtracts the smaller number from the larger number recursively.

Since $255 = 17 \times 15$, subtracting $15$ repeatedly from $255$ eventually yields $(15, 15)$. When $x = 15$ and $y = 15$, the condition if (x == y) evaluates to true and returns 15.