Sierpinski Fractals v1.0

Description

This program creates any Sierpinski Fractal, the fractal n-gon created by removing the central N-gon, and then distributing one of itself at each vertex (and for N=4, at each edge). I was inspired by the well-known (to some) Sierpinski Triangle example that TI shared in the thick physical manual they used to provide with each graphing calculator to implement a generalized Sierpinski program for any N-sided polygon for the TI-84 Evo. Simply enter the number of sides for your regular polygon, and this program will use the Chaos Game method to generate the fractal. Press [CLEAR] or any other key to quit, and your graph settings will be restored. See the README for more information about how it works.