The FFT is a fast algorithm that lets you move from one to the other. It's trying to decompose the polynomial, work with the parts and recurse. And as you do that, are you going from a number of points along a graph with the line thread or you're going to the coefficients? In Fry, so in Fry you're just working, so you start off with, so you're looking at the evaluation perspective for a degree deponomial.

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode