Recursion | GCD | Euclids Algorithm | Lecture 31 | Java & DSA Course

// BY LONG DIVISION CONCEPT :


package Recursion;
import java.util.Scanner;


public class RecGCDbyEuclidAlgorithm {

     public static int gcd(int x,int y){



          if(y==0) return x;
          return gcd(y,x%y);


     }

     public static void main(String[] args) {

          Scanner sc=new Scanner(System.in);
          System.out.println("Enter x and y: ");
          int x=sc.nextInt();
          int y=sc.nextInt();


          int ans=gcd(x,y);
          System.out.println("gcd of "+x+" and"+y+" is :"+ans);
          sc.close();
     }

}