GCD recursively

 Description:          The following program takes two numbers as input and determines the Greatest Common Divisor for them using recursion.                             Primary Inputs:    Two numbers Primary Output:    Determine the Greatest Common Divisor for input numbers Platform Used:      JDK 1.6 with Notepad.    import java.io.*; class GCDRecurse { public static void main(String[] args) { Console con=System.console(); System.out.print("Enter the first number for finding GCD: ...