Hi,
I've written a simple FORTRAN program to render the Mandelbrot set into a 640*480 24 bit colour windows bitmap file.
I've tried a few ways of rendering it:
1. using the number of iterations until the distance away is greater than 2
2. using the distance away from the original point or the origin
3. using a 16*16 grid of points within each pixel, iterating 20 times and if 'z' is greater than 2 it's in the set, and the colour of the pixel is the number of those 256 points that are 'in' the set.

They have given me the following outputs, and I'm reasonably happy with them, but how do you get it to display the curls that everyone elses programs show?

Cheers lycium! I made a rookie mistake somewhere in my program. It now displays the full beauty of the M-set!

Here are some pics!






I now feel like purging those pollutions of the fractal from my website and from this topic. Instead I'll probably replace them with tiny ones!

This was the sequence resulting from my stupid error:

(real part)   (real part)  (imaginary part)
   Z(n+1)  = Z(n)*Z(n)-Z(n)*Z(n)                   (real eqn)
THEN
     (imaginary part)      (real part)
   Z(n+1)  = 2*Z(n)  *   Z(n+1)                      (im eqn)

If you zoom in a tiny bit it seems to exhibit some fractal behaviour, but it stops after a short while.