31 lines
989 B
Python
31 lines
989 B
Python
import time
|
|
|
|
def linspace(start, stop, n):
|
|
if n == 1:
|
|
yield stop
|
|
return
|
|
h = (stop - start) / (n - 1)
|
|
for i in range(n):
|
|
yield start + h * i
|
|
|
|
def mandelbrot(pmin: float = -2.5, pmax: float = 1.5, qmin: float = -2, qmax: float = 2,
|
|
ppoints: int = 200, qpoints: int = 200, max_iterations: int = 300, infinity_border: float = 100) -> list[list[int]]:
|
|
|
|
image: list[list[int]] = [[0 for i in range(qpoints)] for j in range(ppoints)]
|
|
for ip, p in enumerate(linspace(pmin, pmax, ppoints)):
|
|
for iq, q in enumerate(linspace(qmin, qmax, qpoints)):
|
|
c: complex = p + 1j * q
|
|
z: complex = 0
|
|
for k in range(max_iterations):
|
|
z = z ** 2 + c
|
|
if abs(z) > infinity_border:
|
|
image[ip][iq] = 1
|
|
break
|
|
return image
|
|
|
|
tic = time.perf_counter_ns()
|
|
image = mandelbrot()
|
|
toc = time.perf_counter_ns()
|
|
print((toc - tic)/1_000_000_000, "s")
|
|
|