Fast Fourier transform — FFT — is speed-up technique for calculating discrete Fourier transform — DFT, which in turn is discrete version of continious Fourier transform, which indeed is origin for all its versions. So, historically continious form of the transform was discovered, then discrete form was created for sampled signals and then algorithm for fast calculation of discrete version was invented.