Fast Fourier Transform, Algorithms, Pattern Matching, Convolution, Combination Sum.
[fft(x, omega_x)] # Transpose the matrix from previous step new_arr_t = [[0]*len(new_arr) for j in range(len(new_arr[0]))] for i in range(len(new_arr_t)): for j in range(len(new_arr_t[0])): new_arr_t[i][j] = new_arr[j][i] # Do FFT on each row of transposed matrix same as doing FFT on each # column