Fast Fourier Transform Algorithm | Part 3

Steps of FFT algorithm 0:00 Intro 1:00 Quick overview 1:30 Step 1 - Split polynomial 5:01 Step 2 - Square evaluation domain 10:10 Step 3 - Repeat steps 1 and 2 11:08 Step 4 - Combine recursive calls 14:58 Runtime Notes https://github.com/t4sk/notes Playlist https://www.youtube.com/playlist?list=PLO5VPQH6OWdXVERSGpBlUiLdBgJFl0AY2 Follow https://x.com/ProgrammerSmart