Kandinsky

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…

8th edition of the Jornada Programa at Citilab Cornellà with this poster!

  Fibonacci spiral ‌ Recursive function A recursive function is a function that calls itself. We already saw an example of recursive program when we did the Greatest common divisor algorithm. Another typical example is the factorial of a number. The factorial of a number n is the product of 1*2..(n-1)*n. And it is written…

  ‌Finding Pi Every year during the 14th of March we celebrate Pi day. This is due to the fact that Pi is close to 3.14, but what is it’s true value and how can we compute it? In this article you’ll learn two ways of approximating this number! Pi is an irrational number used…