How to resolve the algorithm Barnsley fern step by step in the TI-83 BASIC programming language

Published on 12 May 2024 09:40 PM
#Ti-83 basic

How to resolve the algorithm Barnsley fern step by step in the TI-83 BASIC programming language

Table of Contents

Problem Statement

A Barnsley fern is a fractal named after British mathematician Michael Barnsley and can be created using an iterated function system (IFS).

Create this fractal fern, using the following transformations: Starting position: x = 0, y = 0

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Barnsley fern step by step in the TI-83 BASIC programming language

Source code in the ti-83 programming language

ClrDraw
Input "ITERS:",M
[[0,0,1]]→[A]
[[0,0,0][0,.16,0][0,0,1]]→[B]
[[.85,-.04,0][.04,.85,0][0,1.6,1]]→[C]
[[.2,.23,0][-.26,.22,0][0,1.6,1]]→[D]
[[-.15,.26,0][.28,.24,0][0,.44,1]]→[E]
0→I
While I
randInt(1,100)→R

If R=1
Then
[A][B]→[A]
101→R
End

If R<86
Then
[A][C]→[A]
101→R
End

If R<93
Then
[A][D]→[A]
101→R
End

If R<101:Then
[A][E]→[A]
End

round([A](1,1)*8+31,0)→E
round([A](1,2)*8,0)→F
Pxl-On(E,F)
I+1→I
End

You may also check:How to resolve the algorithm FizzBuzz step by step in the Kamailio Script programming language
You may also check:How to resolve the algorithm Remove duplicate elements step by step in the Octave programming language
You may also check:How to resolve the algorithm Sorting algorithms/Insertion sort step by step in the N/t/roff programming language
You may also check:How to resolve the algorithm Greatest element of a list step by step in the Java programming language
You may also check:How to resolve the algorithm Boolean values step by step in the Racket programming language