fig sierpinski curves and the base pattern of the sierpinski curves is sa and the recursion patterns are (horizontal and vertical arrows denote lines of double length aa bb cc dd if we use the same primitives for drawing as in the hilbert curve examplethe above recursion scheme is transformed without difficulties into (directly and indirectlyrecursive algorithm procedure (kinteger)begin if then ( - )draw line( ) ( - )draw line( * ) ( - )draw line( ) ( - end end this procedure is derived from the first line of the recursion scheme procedures corresponding to the patterns bc and are derived analogously the main program is composed according to the base pattern its task is to set the initial values for the drawing coordinates and to determine the unit line length according to the size of the plane the result of executing this program with is shown in fig var hintegerprocedure (kinteger)begin if then ( - )draw line( ) ( - )draw line( * ) ( - )draw line( ) ( - end end aprocedure (kinteger)(adens _sierpinski *