pub fn gcd(a: u64, b: u64) -> u64 {
	let mut bigger = max(a,b);
	let mut smaller = min(a,b);
	let mut remainder = bigger % smaller;

	while remainder != 0 {
		bigger = smaller;
		smaller = remainder;
		remainder = bigger % smaller
	}
	smaller
}
//classical euclidean algorithm implemented non-recusively
classical euclidean algorithm implemented non-recusively
classical euclidean algorithm implemented non - recusively
pub fn gcd(a: u64, b: u64) -> u64 {
	let mut bigger = max(a,b);
	let mut smaller = min(a,b);
	let mut remainder = bigger % smaller;
	while remainder != 0 {
		bigger = smaller;
		smaller = remainder;
		remainder = bigger % smaller
	}
	smaller
}
pub fn gcd ( a : u64 , b : u64 ) -> u64 { let mut bigger = max ( a , b ) ; let mut smaller = min ( a , b ) ; let mut remainder = bigger % smaller ; while remainder != 0 { bigger = smaller ; smaller = remainder ; remainder = bigger % smaller } smaller }
classical euclidean algorithm implemented non-recusively
classical euclidean algorithm implemented non - recusively
a
u64
b
u64