Drawing a Sierpinski Triangle with Python Turtle

SIGN UP TO THE NEXT WEBINAR: www.eventbrite...
We will cover the core concept s of python and do some problem solving
#SierpinskiTriangle, #PythonTurtle, #SierpinskiTurtle
~-~~-~~~-~~-~
Latest and Best Arduino Playlist in Collaboratio with DFRobot:
• Arduino Zero to Hero
~-~~-~~~-~~-~

[@hamavanti]

I'm proud to be Polish like Sierpinski :)

[@SanjinDedic]

Free fractals event join in to ask question live:www.eventbrite.com.au/e/free-python-extension-workshop-fractal-geometry-with-python-turtle-tickets-103070984088

[@OOO-yj1ve]

great video

[@SHELDONSHOW]

thank you everything is available and clear

[@elriclescop5134]

To make the Sierpinski function with a x, I did sierpinski(12.5*(2**(x-1)), x) but I think there is a much more easy way to do it

[@benjaminli183]

helped so much

[@Oztelsalih]

Thank you veryyyy much >_

[@joshuam2341]

Is this a recursive algorithm?

[@SanjinDedic]

Yes it definitely is . . .a function calling itself and a lower scale thats recursion

[@DamienMATTEI]

amazing! but the explication are poors, in fact the real problem is that Fractals are reccurents objects with a lot of symetry and this point is not used , a better algorithm would use this symetry to save time complexity.The time complexity is here exponential.