g = g2 >> 1;
if (g)
{
- // subdivide, diamond-square algorythm (really this has little to do with squares)
+ // subdivide, diamond-square algorithm (really this has little to do with squares)
// diamond
for (y = 0;y < size;y += g2)
for (x = 0;x < size;x += g2)
g = g2 >> 1;
if (g)
{
- // subdivide, diamond-square algorythm (really this has little to do with squares)
+ // subdivide, diamond-square algorithm (really this has little to do with squares)
// diamond
for (y = 0;y < size;y += g2)
for (x = 0;x < size;x += g2)
}
#undef n
}
+