pub fn GCD(x: u32, y: u32) -> u32{
    let mut first_num;
	let mut second_num;
	let mut remainder;
	if x > y{
	    first_num = x;
	    second_num = y;
	} else {
	    first_num = y;
	    second_num = x;
	}
	remainder = first_num % second_num;
	while remainder != 0{
	    first_num = second_num;
        second_num = remainder;
		remainder = first_num % second_num;
	}
	second_num
}
//GCD
//Purpose:
//    Given two positive numbers returns their gcd.
//Pre-conditions:
//    Both numbers x and y are positive.
GCD
Purpose:
Given two positive numbers returns their gcd.
Pre-conditions:
Both numbers x and y are positive.
GCD Purpose : Given two positive numbers returns their gcd . Pre - conditions : Both numbers x and y are positive .
pub fn GCD(x: u32, y: u32) -> u32{
    let mut first_num;
	let mut second_num;
	let mut remainder;
	if x > y{
	    first_num = x;
	    second_num = y;
	} else {
	    first_num = y;
	    second_num = x;
	}
	remainder = first_num % second_num;
	while remainder != 0{
	    first_num = second_num;
        second_num = remainder;
		remainder = first_num % second_num;
	}
	second_num
}
pub fn GCD ( x : u32 , y : u32 ) -> u32 { let mut first_num ; let mut second_num ; let mut remainder ; if x > y { first_num = x ; second_num = y ; } else { first_num = y ; second_num = x ; } remainder = first_num % second_num ; while remainder != 0 { first_num = second_num ; second_num = remainder ; remainder = first_num % second_num ; } second_num }
GCD
Purpose:
Given two positive numbers returns their gcd.
GCD Purpose : Given two positive numbers returns their gcd .
x
u32
y
u32