Fourier Transform, Fft, Fast Fourier Transform, Algorithms, Mathematics.
for large number of input points. for n in range(8, 15): x = generate_points((1 << n)) print((1 << n)) %timeit dft(x) %timeit abs(fft(x)) print() The results are as follows: 256 10.3 ms ± 145 µs per loop (mean ± std. dev. of 7 runs, 100 loops each) 7.78 ms ± 248 µs per loop (mean ± std. dev. of 7