Find the greatest common divisor of two integers using a recursive method of the Euclidean Algorithm. Utilizes a basic Netbeans generated GUI with JFrame
bmb7904 / recursivegcd Goto Github PK
View Code? Open in Web Editor NEWFinds the greatest common divisor of two integers using a recursive function based on the Euclidean Algorithm. Simple netbeans-generated GUI.