유클리드호제법, 재귀함수, 최대공약수 출력하기(java)

유클리드호제법, 재귀함수 이용 최대공약수 출력하기 

import java.util.Scanner;
 
public class recursion {
 
    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        System.out.print("Please enter an x : ");
        int x = sc.nextInt();
        System.out.println("Please enter an y : ");
        int y = sc.nextInt();
        int answer= gcd(x,y);
        System.out.print("the answer is : "+ answer);
        
 
    }
    //유클리드호제법 & 재귀 
    static int gcd(int x, int y) {
        if(y==0) {
            return x;
        }
        else return gcd(y, x%y);
    }
 
}