Revision as of 08:18, 3 January 2021 edit Raysphere24 (talk \| contribs) 28 edits →Time complexity without zero-padding: new section ← Previous edit		Revision as of 08:19, 3 January 2021 edit undo SineBot (talk \| contribs) Bots 2,564,676 edits m Signing comment by Raysphere24 - "→Time complexity without zero-padding: new section" Next edit →
Line 23: == Time complexity without zero-padding == Without zero-padding, the article states that the worst case requires O(N<sup>2</sup>) time. But each step of the recursion halves N, therefore isn't it still O(N log N) time? <!-- Template:Unsigned --><span class="autosigned" style="font-size:85%;">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Raysphere24\|Raysphere24]] ([[User talk:Raysphere24#top\|talk]] • [[Special:Contributions/Raysphere24\|contribs]]) 08:18, 3 January 2021 (UTC)</span> <!--Autosigned by SineBot-->

Talk:Rader's FFT algorithm: Difference between revisions