Update computer-science/algorithms/sierpinski_gasket.md

sachsy · Jan 18, 2016 · 5c14c0f · 5c14c0f
1 parent 4c70ea7
commit 5c14c0f
Showing 1 changed file with 4 additions and 0 deletions.
diff --git a/computer-science/algorithms/sierpinski_gasket.md b/computer-science/algorithms/sierpinski_gasket.md
@@ -7,3 +7,7 @@
 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 Sierpinski gasket on the top-left square, top-right square and bottom-right square.
 
+
+## Implementation
+
+![](codepen://cuadraman/yezmEd)