WSQ06 TC201 GCD

Greatest common divisor

//Greatest Common Divisor by Gilberto Rogel García A01630171
public class GCD {
	public int num;
	public GCD(int num){
		this.num = num;
	}
	public int greatestCD(int x){
		
		if (this.num == x){
			//System.out.println("a"+x);
			return x;
		}
		else{
			if(x > this.num){
				x = x - this.num;
				//System.out.println("b"+x);
				return this.greatestCD(x);
			}
			else{
				this.num = this.num - x;
				//System.out.println("c"+x);
				return this.greatestCD(x);
			}
		}
	}
	public static void main(String[] args){
		GCD banana1 = new GCD(25);
		int z = banana1.greatestCD(10);
		System.out.println("Greatest Common Divisor: "+ z);
	}
}