Bifalgorithm post

This is probably the most used algorithm in the entire world, if I'm completely honest. 1965, we have the invention of the fast Fourier transform. The Fourier transform is this idea of taking signal in the time domain. For example, you've got a microphone. I speak into it. The microphone vibrates based on the sound waves that are coming. And then from that vibration, you can then play it back on the speaker. Doing that is going to be quite expensive data-wise. because I've got to send all of that data, right? It would be really nice if we could decompose that time signal into a frequency. For example, you know, when I play a chord on a piano, one way to send all of that sound data is to send the microphone data, or I could just send the notes that I played on the piano. It's a way cheaper way of sending information. And in order to do that, you'd like to do a Fourier transform. Now, notoriously, this thing is... extremely expensive to do computationally. Mathematicians John Tukey and James Cooley developed the fast Fourier transform at Princeton University and they reduced that computational complexity to something that was totally manageable. Complexity went from order of n squared to n log n, which is way lower when it comes to large n. And it launched modern digital signal processing. No one's made a better... way to do a Fourier transform fast. Except for the guys at Pied Piper in Silicon Valley.

This is probably the most used algorithm in the entire world, if I'm completely honest. 1965, we have the invention of the fast Fourier transform. The Fourier…