Skip to content

Adding missing examples for Tree Traversal and FFT in C. #109

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 11 commits into from
May 20, 2018
Merged

Adding missing examples for Tree Traversal and FFT in C. #109

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
6a82e2b
Adding DFT to fft.c
Gathros May 13, 2018
e8bac04
Adding missing examples to tree_traversal.c
Gathros May 13, 2018
69571a8
updating tree_traversal.md
Gathros May 13, 2018
9d04116
Updating cooley-tukey.md and small changes to fft.c
Gathros May 13, 2018
6b2a4e2
Fixing an error in tree_traversal.c
Gathros May 14, 2018
e9daddc
Changing bit_reverse in fft.c
Gathros May 15, 2018
c7dc32e
updating cooley-tukey.md
Gathros May 15, 2018
e82ed09
Merge branch 'master' into missingexamples
Gathros May 15, 2018
0cf605d
improving tree_traversal.c
Gathros May 18, 2018
3123eeb
updating tree_traversal.md
Gathros May 18, 2018
d5fb209
using memcpy in fft.c
Gathros May 20, 2018
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Updating cooley-tukey.md and small changes to fft.c
  • Loading branch information
@Gathros
Gathros committed May 13, 2018
commit 9d04116d88483d65328d45f382760f3f2a2b42c6
6 changes: 2 additions & 4 deletions chapters/FFT/code/c/fft.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,12 +9,10 @@
void dft(double complex *X, const size_t N) {
double complex tmp[N];
for (size_t i = 0; i < N; ++i) {
double complex sum = 0 + 0 * I;
tmp[i] = 0;
for (size_t j = 0; j < N; ++j) {
sum += X[j] * cexp(-2.0 * PI * I * j * i / N);
tmp[i] += X[j] * cexp(-2.0 * PI * I * j * i / N);
}

tmp[i] = sum;
}

for (size_t i = 0; i < N; ++i) {
Copy link
Contributor

@zsparal zsparal May 20, 2018

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This is just a memcpy
Expand Down
4 changes: 2 additions & 2 deletions chapters/FFT/cooley_tukey.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -72,7 +72,7 @@ For some reason, though, putting code to this transformation really helped me fi
{% sample lang="jl" %}
[import:2-11, lang:"julia"](code/julia/fft.jl)
{% sample lang="c" %}
[import:2-11, lang:"julia"](code/julia/fft.jl)
[import:9-21, lang:"c_cpp"](code/c/fft.c)
{% sample lang="cpp" %}
[import:2-11, lang:"julia"](code/julia/fft.jl)
{% sample lang="hs" %}
Expand Down Expand Up @@ -117,7 +117,7 @@ In the end, the code looks like:
{% sample lang="jl" %}
[import:14-31, lang:"julia"](code/julia/fft.jl)
{% sample lang="c" %}
[import:9-28, lang:"c_cpp"](code/c/fft.c)
[import:23-42, lang:"c_cpp"](code/c/fft.c)
{% sample lang="cpp" %}
[import:27-57, lang:"c_cpp"](code/c++/fft.cpp)
{% sample lang="hs" %}
Expand Down