This project report describes the implementation of the Fast Fourier Transform (FFT) algorithm using LabVIEW. The FFT is an optimized version of the Discrete Fourier Transform (DFT) that reduces redundant calculations, making it faster. The report defines the FFT and DFT, describes the FFT algorithm including twiddle factors and a 3-stage radix-2 approach. It discusses how FFT is applied using a divide and conquer method. The LabVIEW block diagram and front panel for input/output are shown. Applications of FFT include spectral analysis, digital filtering, medical imaging, and instrumentation.