How to resolve the algorithm Sierpinski triangle step by step in the J programming language

Published on 12 May 2024 09:40 PM
#J

How to resolve the algorithm Sierpinski triangle step by step in the J programming language

Table of Contents

Problem Statement

Produce an ASCII representation of a Sierpinski triangle of order   N.

The Sierpinski triangle of order   4   should look like this:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Sierpinski triangle step by step in the J programming language

Source code in the j programming language

   |. _31]\ ,(,.~ , ])^:4 ,: '* '


   ' *' {~ '1' = (- |."_1 [: ": 2 | !/~) i._16


  

You may also check:How to resolve the algorithm Catamorphism step by step in the Bracmat programming language
You may also check:How to resolve the algorithm Literals/Integer step by step in the Verbexx programming language
You may also check:How to resolve the algorithm Matrix multiplication step by step in the Elixir programming language
You may also check:How to resolve the algorithm Special variables step by step in the Quackery programming language
You may also check:How to resolve the algorithm Zero to the zero power step by step in the Fermat programming language