C Programming

The Mandelbrot set is the set of all complex numbers c for which sequence defined by the iteration

f(n) = f(n-1)*f(n-1) + c, f(0) = c

remains bounded or converges to a fixed point when n tends to infinity.

Implement function f() for n=25 and all c(x, y) such that (-1<=x<=1, -1<=y<=1) with 0.025 steps, so you have 80*80 complex numbers as input to f() to calculate.

When |f()| = sqrt(x*x + y*y) is bigger than 1000, your recursion should consider it is not bounded, or diverges, so you return 100 instead of the calculated number.

Save a character in a character array of img[81][81] for each (x, y) you calculated. If the value converges, you can save a "#" or "*", or "X". Otherwise, you save an empty "SPACE", or "-".

Print out your character array on the screen.

Your program should be in one directory with several files.

A file called "f.h" should be the header file that includes all function prototypes.

A file called "main.c" should be your main function.

A file called "f.c" should be your implementation of f().

You may have other "c" files such as complex number addition and multiplicaton.

A file called "Makefile" should be able to "make" the executable "m"

After you finish, you can compress the directory of the current project into one file for upload. Let's say your directory is called "Mandelbrot" and using "ls" command you can see it. You can use the following command to compress it:

"tar -cf [url removed, login to view] Mandelbrot". Then upload your file "[url removed, login to view]". You should be able to de-compress your file by "tar -xf [url removed, login to view]".

Programação C

ID do Projeto: #5790247

Sobre o projeto