Adding missing examples for Tree Traversal and FFT in C. #109
Conversation
Gathros
added
Implementation Edit
| printf("%d\n", n.id); | ||
| } | ||
|
|
||
| void dfs_recursive_inorder_btree(node n) { |
There was a problem hiding this comment.
This function has a case for the number of children from 0-2; however, what about the cases when n>2?
There was a problem hiding this comment.
It's in the default case.
There was a problem hiding this comment.
Ah, sorry. I kinda forgot that this section only works on binary trees.
chapters/FFT/code/c/fft.c
Outdated
| } | ||
| for (unsigned int i = 0; i < N; ++i) { | ||
| b = i; | ||
| b = (((b & 0xaaaaaaaa) >> 1) | ((b & 0x55555555) << 1)); |
There was a problem hiding this comment.
Since we are updating this code, would it be possible to leave a quick comment on what is happening here? This is probably quite confusing to new folks.
There was a problem hiding this comment.
Haha yeah, it looks like black magic to me :)
| //DFS_stack(root); | ||
| //BFS_queue(root); | ||
| dfs_recursive(root); | ||
| //dfs_stack(root); |
There was a problem hiding this comment.
I comment out unnecessary functions with my julia code too, but I wonder if there is a better way of doing it?
There was a problem hiding this comment.
I'll just remove the comments then.
chapters/FFT/code/c/fft.c
Outdated
| } | ||
| } | ||
|
|
||
| for (size_t i = 0; i < N; ++i) { |
june128
removed
the
Chapter Edit
No description provided.