Timeline for Too Fast, Too Fourier: FFT Code Golf
Current License: CC BY-SA 4.0
40 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 24, 2020 at 15:27 | history | edited | caird coinheringaahin g♦ | CC BY-SA 4.0 |
deleted 46 characters in body
|
| Oct 19, 2019 at 6:42 | history | edited | caird coinheringaahin g♦ | CC BY-SA 4.0 |
added 4 characters in body
|
| Oct 19, 2019 at 5:37 | answer | added | user58988 | timeline score: 1 | |
| Oct 18, 2019 at 5:50 | answer | added | ceilingcat | timeline score: 1 | |
| Sep 10, 2017 at 10:41 | answer | added | ceilingcat | timeline score: 2 | |
| Aug 13, 2017 at 21:07 | comment | added | user58988 | If the problem for fft is the speed why not use some other tag and not "codegolf" tag? I not had identified the problem where this fft is slow... Can someone give some input where this fft functions are slow? | |
| Aug 11, 2017 at 22:50 | answer | added | user58988 | timeline score: 0 | |
| Aug 11, 2017 at 21:49 | comment | added | user58988 | Instead of point to the page fft O(n^2) why not point to the page fast Fourier transform with O(n*log_2(n)) | |
| Aug 11, 2017 at 21:00 | comment | added | user58988 | Where are the tests cases? | |
| Nov 14, 2016 at 7:32 | comment | added | clismique | Title should have been "Fast and Fourier-s" (Fast and Furious). | |
| Aug 1, 2016 at 19:48 | answer | added | miles | timeline score: 2 | |
| Mar 8, 2015 at 11:57 | comment | added | FUZxxl | Can you post some example inputs and outputs so we can test our implementations? | |
| Mar 7, 2015 at 22:48 | answer | added | flawr | timeline score: 3 | |
| Nov 23, 2014 at 15:31 | history | edited | Beta Decay |
Added [complex-numbers] tag
|
|
| Apr 15, 2014 at 11:33 | review | Close votes | |||
| Apr 15, 2014 at 14:21 | |||||
| Apr 15, 2014 at 11:14 | comment | added | user80551 | VTC as no IO requirements mentioned. | |
| Apr 15, 2014 at 10:45 | answer | added | sanaris | timeline score: 4 | |
| Apr 14, 2014 at 19:56 | answer | added | Nayuki | timeline score: 6 | |
| S Oct 25, 2013 at 11:48 | history | suggested | Vi. |
Add "math" tag
|
|
| Oct 25, 2013 at 10:19 | review | Suggested edits | |||
| S Oct 25, 2013 at 11:48 | |||||
| Sep 8, 2013 at 18:32 | answer | added | boothby | timeline score: 4 | |
| Sep 6, 2013 at 18:17 | answer | added | miles | timeline score: 9 | |
| Sep 4, 2013 at 12:13 | answer | added | plannapus | timeline score: 5 | |
| S Sep 3, 2013 at 0:14 | history | suggested | p.s.w.g | CC BY-SA 3.0 |
Added referenced equation to question
|
| Sep 2, 2013 at 23:47 | review | Suggested edits | |||
| S Sep 3, 2013 at 0:14 | |||||
| Aug 31, 2013 at 11:51 | answer | added | P̲̳x͓L̳ | timeline score: 1 | |
| Aug 31, 2013 at 1:17 | answer | added | miles | timeline score: 12 | |
| Aug 30, 2013 at 23:20 | history | edited | jakevdp | CC BY-SA 3.0 |
deleted 444 characters in body
|
| Aug 30, 2013 at 23:20 | answer | added | jakevdp | timeline score: 9 | |
| Aug 30, 2013 at 16:05 | comment | added | jakevdp | See the edits to the rules. The output should be a list/array with values ordered according to the indices in the standard DFT expression, referenced above. | |
| Aug 30, 2013 at 16:00 | history | edited | jakevdp | CC BY-SA 3.0 |
Respond to comments
|
| Aug 30, 2013 at 15:20 | history | tweeted | twitter.com/#!/StackCodeGolf/status/373465339071565824 | ||
| Aug 30, 2013 at 8:22 | comment | added | Paul R | Does it matter about the order of the output elements, i.e. do we need to implement bit reversed unscrambling or can we leave the output in scrambled order ? | |
| Aug 30, 2013 at 7:24 | comment | added | Peter Taylor |
This is underspecified. At the very least you need to define the normalisation factors, and you also ought to be aware that any ambiguity will be wilfully misinterpreted. E.g. is "Implement" satisfied by the answer "FFT (3 chars): it's in the standard library"? Some test cases would be good too.
|
|
| Aug 30, 2013 at 2:15 | history | edited | jakevdp | CC BY-SA 3.0 |
change title
|
| Aug 29, 2013 at 23:52 | history | edited | jakevdp | CC BY-SA 3.0 |
added 42 characters in body
|
| Aug 29, 2013 at 23:40 | review | First posts | |||
| Aug 30, 2013 at 11:10 | |||||
| Aug 29, 2013 at 23:37 | history | edited | jakevdp | CC BY-SA 3.0 |
added 57 characters in body
|
| Aug 29, 2013 at 23:27 | history | edited | jakevdp | CC BY-SA 3.0 |
Add Python example
|
| Aug 29, 2013 at 23:22 | history | asked | jakevdp | CC BY-SA 3.0 |