Benvinguts al taller de robòtica!
Clicant en aquest enllaç podreu accedir a la plataforma de programació eSeeCode .
The greatest common divisor between two numbers is defined as the largest value that can divide both numbers.
To compute the greatest common divisor there are many algorithms. One of the fastest is over 2 millennium old. It's called Euclid's algorithm. Here you will be able to learn more about this algorithm and how to program it. Also you will learn how to visualize the number of iterations it needs to find the result.
We are getting close to the end of the year and we want to wish you happy holidays! To do so we have created this cute gif, and we will explain how we did it step by step.