-
-
Explorium
Benvinguts al taller de robòtica! Fent un quadrat Clicant en aquest enllaç podreu accedir a la plataforma de programació eSeeCode . =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Utilitzant bucles Podem simplificar el codi anterior utilitzant un bucle. Els bucles poden ser amb comptadors (per repetir un nombre de cops) o amb condicions (mentre es compleixi una condició). Els primers són…
-
-
Greatest Common Divisor
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…
-
Merry Everything from eSeeCode
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. Koch Snowflake Open it in eSeeCode! =0){divElement.className=divElement.className.replace(‘glyphicon-minus’,’glyphicon-plus’);}else{divElement.className=divElement.className.replace(‘glyphicon-plus’,’glyphicon-minus’);}”> Step 1: Build Koch fractal As it can be read…
-
-
-
-
-