How to resolve the algorithm Fractal tree step by step in the 11l programming language

Published on 12 May 2024 09:40 PM
#11l

How to resolve the algorithm Fractal tree step by step in the 11l programming language

Table of Contents

Problem Statement

Generate and draw a fractal tree.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Fractal tree step by step in the 11l programming language

Source code in the 11l programming language

-V
   Width = 1000
   Height = 1000
   TrunkLength = 400
   ScaleFactor = 0.6
   StartingAngle = 1.5 * math:pi
   DeltaAngle = 0.2 * math:pi

F drawTree(outfile, Float x, Float y; len, theta) -> N
   I len >= 1
      V x2 = x + len * cos(theta)
      V y2 = y + len * sin(theta)
      outfile.write("\n".format(x, y, x2, y2))
      drawTree(outfile, x2, y2, len * ScaleFactor, theta + DeltaAngle)
      drawTree(outfile, x2, y2, len * ScaleFactor, theta - DeltaAngle)

V outsvg = File(‘tree.svg’, ‘w’)
outsvg.write(|‘
               
               
               
               ’)
drawTree(outsvg, 0.5 * Width, Height, TrunkLength, StartingAngle)
outsvg.write("\n")

You may also check:How to resolve the algorithm Reverse a string step by step in the CLU programming language
You may also check:How to resolve the algorithm Deconvolution/1D step by step in the Fortran programming language
You may also check:How to resolve the algorithm Bitwise IO step by step in the 6502 Assembly programming language
You may also check:How to resolve the algorithm Wireworld step by step in the C++ programming language
You may also check:How to resolve the algorithm Range extraction step by step in the PL/I programming language