Kas saaks nimetada suurima ühise jagaja (SÜJ) leidmise algoritmiga seotud põhielemente?

Main entities related to the algorithm for finding the greatest common divisor (GCD):

• Two integers — input data for which the GCD needs to be found.
• Division remainder — a key operation in Euclid's algorithm, used for successively reducing the numbers.
• Recursion or iteration — method of implementing the algorithm, where at each step the GCD for a pair of numbers is calculated until one of them becomes zero.