Recursive GCD in Java

public class GCD{

   public static void main(String[] args)
   {
      System.out.println(gcd(30,6));
   }
   public static long gcd ( long a, long b )
   {
      if (b == 0 )
         return a;
      else
         return gcd ( b, a%b );
   }
}