Euclidean Algorithm
Computational Thinking: Euclidean Algorithm
Computational Thinking: Euclidean Algorithm
Represented in the flowchart on the right, the Euclidean Algorithm is an efficient series of steps that will determine the Highest Common Factor between 2 numbers (Input A & B, A > B) without prime factorising the 2 numbers.
Represented in the flowchart on the right, the Euclidean Algorithm is an efficient series of steps that will determine the Highest Common Factor between 2 numbers (Input A & B, A > B) without prime factorising the 2 numbers.
Click on the button to play with the Python code.
Click on the button to play with the Python code.
