The Sierpinski Fractal
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 4751 | Accepted: 1968 |
Description
Consider a regular triangular area, divide it into four equal triangles of half height and remove the one in the middle. Apply the same operation recursively to each of the three remaining triangles. If we repeated this procedure infinite times, we'd obtain something with an area of zero. The fractal that