Java:实现快速傅里叶变换算法（附完整源码）

package com.williamfiset.algorithms.math;

public class FastFourierTransform {
   

  // p is a prime number set to be larger than 2^31-1
  private static long p = 4300210177L;

  // q is 2^64 mod p used to compute x*y mod p
1
2
3
4
5
6
7
8
9