Shorter version of formula, one line less

Author: mika314

contents/cooley_tukey/code/c++/fft.cpp

@@ -26,8 +26,7 @@ void dft(Iter X, Iter last) {
   std::vector<complex> tmp(N);
   for (auto i = 0; i < N; ++i) {
     for (auto j = 0; j < N; ++j) {
-      using namespace std::literals::complex_literals;
-      tmp[i] += X[j] * exp(-2.0 * M_PI * i * j / N * 1i);
+      tmp[i] += X[j] * exp(complex(0, -2.0 * M_PI * i * j / N));
     }
   }
   std::copy(std::begin(tmp), std::end(tmp), X);

contents/cooley_tukey/cooley_tukey.md

@@ -119,7 +119,7 @@ In the end, the code looks like:
 {% sample lang="c" %}
 [import:20-39, lang:"c_cpp"](code/c/fft.c)
 {% sample lang="cpp" %}
-[import:36-67, lang:"c_cpp"](code/c++/fft.cpp)
+[import:35-66, lang:"c_cpp"](code/c++/fft.cpp)
 {% sample lang="hs" %}
 [import:6-19, lang:"haskell"](code/haskell/fft.hs)
 {% sample lang="py" %}