{
  "translations": {
    "en": {
      "sc1": "Perform Fast Fourier Transform on the given array.",
      "sc2": "The array only has one value which is returned.",
      "sc3": "Split into an even and an odd array by placing all values with an even index into the even array and all values with an odd index into the odd array.",
      "sc4": "List 1 is a Fast Fourier Transform of the even array.",
      "sc5": "List 2 is a Fast Fourier Transform of the odd array.",
      "sc6": "Now we compute the new array. Each value of the array is computed using: $list1[k] + z*list2[k]$. Where $k = index\\%(n/2)$ and $z=e^{2\\pi ij/n}$.",
      "sc7": "The polynomial has been transfromed and is returned.",
      "sc8": "Perform Fast Fourier Transform on the given polynomial. The values of the array are the coefficients of each term of the polynomial."
    },
    "zh": {
      "sc1": "对给定数组执行快速傅里叶变换（FFT）。",
      "sc2": "该数组只有一个值，直接返回它。",
      "sc3": "将偶数下标的所有值放入偶数组、奇数下标的所有值放入奇数组，从而拆分为偶数组和奇数组。",
      "sc4": "列表 1 是偶数组的快速傅里叶变换。",
      "sc5": "列表 2 是奇数组的快速傅里叶变换。",
      "sc6": "现在计算新数组。数组的每个值都用 $list1[k] + z*list2[k]$ 计算，其中 $k = index\\%(n/2)$，$z=e^{2\\pi ij/n}$。",
      "sc7": "多项式已完成变换并返回。",
      "sc8": "对给定多项式执行快速傅里叶变换。数组中的各个值是多项式每一项的系数。"
    }
  },
  "code": {
    "java": [
      {
        "url": "../../../SourceCode/Java/SeniorAlgAnal/FFTprocedureCON.java",
        "lineNumbers": false,
        "startAfter": "/* *** ODSATag: FFTprocedure *** */",
        "endBefore": "/* *** ODSAendTag: FFTprocedure *** */",
        "top": 0,
        "left": 0,
        "tags": {
          "split": [
            12,
            13,
            14,
            15
          ],
          "if": [
            8,
            9,
            10,
            11
          ],
          "list1": 16,
          "list2": 17,
          "loop": [
            18,
            19,
            20,
            21,
            22
          ],
          "fft": 1,
          "return": 24
        }
      }
    ]
  }
}