This is my code so far.
Sierpinski carpet python turtle code.
Here is my idea.
The code can look prettier and more pythonic too since the technique lets you get rid of the recursion.
Previous previous post.
Quick sort is even faster than merge sort.
Pen left 90 s n 1 l pen right 45.
You can change the speed of the turtle by doing turtle speed number.
The sierpinski carpet is a plane fractal curve i e.
Versions 2 and 3 plotscf gp and plotscf1 gp file functions for the load command are the only possible imitation of the fine functions in the gnuplot.
From turtle import make a screen and a pen pen pen screen screen pen speed 0 pen color orange pen width 1 5 def s n l.
Python has a module called turtle that allows us to draw cool shapes very easily.
For i in range 4.
In these type of fractals a shape is divided into a smaller copy of itself removing some of the new copies and leaving the remaining copies in specific order to form new shapes of fractals.
This is the best code for sierpinski triangle.
Colorsys fractal hsv recursion.
Colorful sierpinski carpet with python turtle.
Quick sort animation with python and turtle with source code merge sort algorithm is fast but it requires additional array and additional copying.
Plotting a sierpinski carpet fractal.
The sieprinski carpet is given by d 2 b 3 m 1 a 1 and the menger sponge is the same but with d 3.
Recursive sierpinski carpet using turtle graphics.
Import turtle def draw sierpinski.
Pen right 45 s n 1 l pen left 90.
A curve that is homeomorphic to a subspace of plane.
It was first described by waclaw sierpinski in 1916.
Turtle setposition x y will set the turtle s position to the coordinates you plug in.
Counter 0 while counter sides.
Let s talk a little about the algorithm we ll use to go about drawing the sierpinski triangle.
I am trying to create the sierpinski carpet in python using turtle.
Note that you need to make sure the turtle s pen is up otherwise it ll draw a line back to that.
Implement quick sort.
I m a python beginner so at the moment i can only see that you can slightly improve your code using range in the function draw polygon so instead of.
0 0 is located at the center of the screen where the turtle first started.
A turtle forward length a turtle right 360 sides counter counter 1.
Since it is impossible to draw infinitely many points on the screen there is a parameter k specifying which iteration you want and what it essentially does is limits the number of digits in each coordinate to k.