Update computer-science/algorithms/sierpinski_gasket.md

Jorge Cuadra · Jorge Cuadra · commit 18f0e4d501b7 · 2016-01-17T12:06:58.000-08:00
diff --git a/computer-science/algorithms/sierpinski_gasket.md b/computer-science/algorithms/sierpinski_gasket.md
@@ -1,2 +1,6 @@
 # Sierpinski gasket
 
+## Pseudo-code
+
+1. Determine the smallest unit of a square will be. If it reaches that size, then fill it with a solid color.
+2. Otherwise, divide the square into four squares. Recursively draw a Spierpinski gasket on the top-left square, top-right square and bottom-right square.
