/recursiveGCD

Finds the greatest common divisor of two integers using a recursive function based on the Euclidean Algorithm. Simple netbeans-generated GUI.

Primary LanguageJava

recursiveGCD

Find the greatest common divisor of two integers using a recursive method of the Euclidean Algorithm. Utilizes a basic Netbeans generated GUI with JFrame