THE ANSWER I PUT IS JUST A GUESS, IF IT ISN'T THE ANSWER PLEASE TELL ME WHAT IT IS I BEG YOU
2 answers:
You might be interested in
Answer:
False
Step-by-step explanation:
Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.
A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.
Quotient and/or Remainder =
