Tracing Recursive Method That Calculates GCD

I have this code and i want to trace it

public static int GCD ( int x , int y ) {
if ( y == 0 )
return x;
else if ( x >= y && y > 0)
return GCD ( y , x % y );
else return GCD ( y , x );
}

(it is a recursive method that calculates the greatest common divisor using Euclidean method )

while x = 32 and y = 46

I want here to understand how the code work ? Precisely , composition and decomposition operations.